Families of automata characterizing context-sensitive languages

Authors:
Christophe Morvan;Chloé Rispal
Affiliations:
Université de Marne-la-Vallée, Institut Gaspard Monge, 5, bd Descartes, 77454, Marne-la-Vallée cedex 2, France;Université de Marne-la-Vallée, Institut Gaspard Monge, 5, bd Descartes, 77454, Marne-la-Vallée cedex 2, France
Venue:
Acta Informatica
Year:
2005

Citing 0
Cited 3

Left-most derivation and shadow-pushdown automata for context-sensitive languages

ICCOMP'06 Proceedings of the 10th WSEAS international conference on Computers
An automata-theoretic characterization of the chomsky-hierarchy

TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Traces of term-automatic graphs

MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the hierarchy of infinite graph families, rational graphs are defined by rational transducers with labelled final states. This paper proves that their traces are precisely context-sensitive languages and that this result remains true for synchronized rational graphs.