Skip to Main content Skip to Navigation
Conference papers

Inverse monoids of higher-dimensional strings

David Janin 1, 2
1 PoSET - Models for a Structured Programming of Space and Time
LaBRI - Laboratoire Bordelais de Recherche en Informatique, SCRIME - Studio de Création et de Recherche en Informatique et Musique Électroacoustique, Inria Bordeaux - Sud-Ouest
Abstract : Halfway between graph transformation theory and inverse semigroup theory, we define higher dimensional strings as bi-deterministic graphs with distinguished sets of input roots and output roots. We show that these generalized strings can be equipped with an associative product so that the resulting algebraic structure is an inverse semigroup. Its natural order is shown to capture existence of root preserving graph mor-phism. A simple set of generators is characterized. As a subsemigroup example, we show how all finite grids are finitely generated. Last, simple additional restrictions on products lead to the definition of subclasses with decidable Monadic Second Order (MSO) language theory.
Complete list of metadata

Cited literature [33 references]  Display  Hide  Download
Contributor : David Janin Connect in order to contact the contributor
Submitted on : Wednesday, August 5, 2015 - 3:31:40 PM
Last modification on : Tuesday, December 8, 2020 - 10:08:59 AM
Long-term archiving on: : Wednesday, April 26, 2017 - 8:36:00 AM


Files produced by the author(s)


  • HAL Id : hal-01165724, version 2



David Janin. Inverse monoids of higher-dimensional strings. 12th International Colloquium on Theoretical Aspects of Computing (ICTAC 2015), 2015, Cali, Colombia. ⟨hal-01165724v2⟩



Record views


Files downloads