Traces of Term-Automatic Graphs - Laboratoire d'Informatique Algorithmique, Fondements et Applications Accéder directement au contenu
Communication Dans Un Congrès Année : 2007

Traces of Term-Automatic Graphs

Résumé

In formal language theory, many families of languages are defined using either grammars or finite acceptors. For instance, context-sensitive languages are the languages generated by growing grammars, or equivalently those accepted by Turing machines whose work tape's size is proportional to that of their input. A few years ago, a new characterisation of context-sensitive languages as the sets of traces, or path labels, of rational graphs (infinite graphs defined by sets of finite-state transducers) was established. We investigate a similar characterisation in the more general framework of graphs defined by term transducers. In particular, we show that the languages of term-automatic graphs between regular sets of vertices coincide with the languages accepted by alternating linearly bounded Turing machines. As a technical tool, we also introduce an arborescent variant of tiling systems, which provides yet another characterisation of these languages.
Fichier principal
Vignette du fichier
mfcs-paper095.pdf (172.85 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00681214 , version 1 (21-03-2012)

Identifiants

Citer

Antoine Meyer. Traces of Term-Automatic Graphs. Mathematical Foundations of Computer Science (MFCS), Aug 2007, Cesky Krumlov, Poland. p. 489-500, ⟨10.1007/978-3-540-74456-6_44⟩. ⟨hal-00681214⟩
78 Consultations
75 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More