Sciweavers

ACTA
2005

Families of automata characterizing context-sensitive languages

13 years 3 months ago
Families of automata characterizing context-sensitive languages
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.
Christophe Morvan, Chloe Rispal
Added 15 Dec 2010
Updated 15 Dec 2010
Type Journal
Year 2005
Where ACTA
Authors Christophe Morvan, Chloe Rispal
Comments (0)