Walking automata in free inverse monoids - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2016

Walking automata in free inverse monoids

Résumé

Walking automata, be they running over words, trees or even graphs, possibly extended with pebbles that can be dropped and lifted on vertices, have long been defined and studied in Computer Science. However, questions concerning walking automata are surprisingly complex to solve. In this paper, we study a generic notion of walking automata over graphs whose semantics naturally lays within inverse semigroup theory. Then, from the simplest notion of walking automata on birooted trees, that is, elements of free inverse monoids, to the more general cases of walking automata on birooted finite subgraphs of Cayley's graphs of groups, that is, elements of free E-unitary inverse monoids, we provide a robust algebraic framework in which various classes of recognizable or regular languages of birooted graphs can uniformly be defined and related one with the other.
Fichier principal
Vignette du fichier
ToAppearInSOFSEM.pdf (376.27 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00738793 , version 1 (05-10-2012)
hal-00738793 , version 2 (04-02-2013)
hal-00738793 , version 3 (05-08-2015)
hal-00738793 , version 4 (03-10-2015)

Identifiants

  • HAL Id : hal-00738793 , version 4

Citer

David Janin. Walking automata in free inverse monoids. 42nd International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM), Jan 2016, Harrachov, Czech Republic. ⟨hal-00738793v4⟩
270 Consultations
360 Téléchargements

Partager

Gmail Facebook X LinkedIn More