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.

• Type: Journal
• Year: 2005
• Where: ACTA
• Authors: Christophe Morvan, Chloe Rispal
• Keywords: ACTA 2005, Infinite Graph Families, Rational Graphs, Rational Transducers