Linearly bounded infinite graphs - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Acta Informatica Année : 2006

Linearly bounded infinite graphs

Résumé

Linearly bounded Turing machines have been mainly studied as acceptors for context-sensitive languages. We define a natural class of infinite automata representing their observable computational behavior, called linearly bounded graphs. These automata naturally accept the same languages as the linearly bounded machines defining them. We present some of their structural properties as well as alternative characterizations in terms of rewriting systems and context-sensitive transductions. Finally, we compare these graphs to rational graphs, which are another class of automata accepting the context-sensitive languages, and prove that in the bounded-degree case, rational graphs are a strict sub-class of linearly bounded graphs.
Fichier principal
Vignette du fichier
acta-29-05.pdf (326.64 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00149109 , version 1 (24-05-2007)

Identifiants

Citer

Arnaud Carayol, Antoine Meyer. Linearly bounded infinite graphs. Acta Informatica, 2006, 43 (4), p. 265-292. ⟨10.1007/s00236-006-0022-z⟩. ⟨hal-00149109⟩
314 Consultations
91 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More