Graph rewriting: an algebraic and logic approach
Handbook of theoretical computer science (vol. B)
Aspects of classical language theory
Handbook of formal languages, vol. 1
On Infinite Transition Graphs Having a Decidable Monadic Theory
ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
A Chomsky-Like Hierarchy of Infinite Graphs
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
A Short Introduction to Infinite Automata
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
An Infinite Automaton Characterization of Double Exponential Time
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Linearly bounded infinite graphs
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Formal modeling of communication protocols by graph transformation
FM'06 Proceedings of the 14th international conference on Formal Methods
Traces of term-automatic graphs
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
| Hi-index | 0.00 |
This paper shows that the traces of rational graphs coincide with the context-sensitive languages.