Families of automata characterizing context-sensitive languages

Christophe Morvan (1) , Chloé Rispal (1)

1 LIGM - Laboratoire d'Informatique Gaspard-Monge

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.

Domaines: Mathématique discrète [cs.DM]

Christophe Morvan, Chloé Rispal. Families of automata characterizing context-sensitive languages. Acta Informatica, 2005, 41, pp.293-314. ⟨10.1007/s00236-004-0160-0⟩. ⟨inria-00525422⟩