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.
Liste complète des métadonnées

Cited literature [33 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01165724
Contributor : David Janin <>
Submitted on : Wednesday, August 5, 2015 - 3:31:40 PM
Last modification on : Tuesday, May 29, 2018 - 9:14:04 AM
Document(s) archivé(s) le : Wednesday, April 26, 2017 - 8:36:00 AM

File

full.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01165724, version 2

Citation

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

Share

Metrics

Record views

488

Files downloads

126