5 search results - page 1 / 1 » Rational Graphs Trace Context-Sensitive Languages |
MFCS
2001
Springer
14 years 1 months ago
2001
Springer
This paper shows that the traces of rational graphs coincide with the context-sensitive languages.
CORR
2006
Springer
13 years 9 months ago
2006
Springer
We investigate families of infinite automata for context-sensitive languages. An infinite automaton is an infinite labeled graph with two sets of initial and final vertices. Its la...
ACTA
2005
13 years 9 months ago
2005
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 conte...
ENTCS
2002
13 years 8 months ago
2002
Morvan and Stirling have proved that the context-sensitive languages are exactly the traces of graphs defined by transducers with labelled final states. We prove that this result ...
MFCS
2007
Springer
14 years 3 months ago
2007
Springer
In formal language theory, many families of languages are defined using grammars or finite acceptors like pushdown automata and Turing machines. For instance, context-sensitive l...