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.
Type de document :
Communication dans un congrès
12th International Colloquium on Theoretical Aspects of Computing (ICTAC 2015), 2015, Cali, Colombia. Springer, 9399, 2015, Lecture Notes in Computer Science
Liste complète des métadonnées


https://hal.archives-ouvertes.fr/hal-01165724
Contributeur : David Janin <>
Soumis le : mercredi 5 août 2015 - 15:31:40
Dernière modification le : lundi 5 octobre 2015 - 17:01:56
Document(s) archivé(s) le : mercredi 26 avril 2017 - 08:36:00

Fichier

full.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-01165724, version 2

Collections

Citation

David Janin. Inverse monoids of higher-dimensional strings. 12th International Colloquium on Theoretical Aspects of Computing (ICTAC 2015), 2015, Cali, Colombia. Springer, 9399, 2015, Lecture Notes in Computer Science. <hal-01165724v2>

Partager

Métriques

Consultations de
la notice

332

Téléchargements du document

83