50 search results - page 1 / 10 » On Bounded Rational Trace Languages |
MST
2010
12 years 11 months ago
2010
MFCS
2001
Springer
13 years 9 months ago
2001
Springer
This paper shows that the traces of rational graphs coincide with the context-sensitive languages.
ACTA
2005
13 years 4 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...
MFCS
2007
Springer
13 years 11 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...
FOSSACS
2001
Springer
13 years 9 months ago
2001
Springer
Hierarchical Message Sequence Charts are a well-established formalism to specify telecommunication protocols. In this model, numerous undecidability results were obtained recently ...