You have Guest access.
Log In
Christophe Morvan and Colin Stirling
Book Chapter
Traces of Term-Automatic Graphs
Antoine Meyer
Lecture Notes in Computer Science, 2007, Volume 4708, Mathematical Foundations of Computer Science 2007, Pages 489-500
Journal Article
Linearly bounded infinite graphs
Arnaud Carayol and Antoine Meyer
Acta Informatica, 2006, Volume 43, Number 4, Pages 265-292
Linearly Bounded Infinite Graphs
Lecture Notes in Computer Science, 2005, Volume 3618, Mathematical Foundations of Computer Science 2005, Pages 180-191
Families of automata characterizing context-sensitive languages
Christophe Morvan and Chloé Rispal
Acta Informatica, 2004, Volume 41, Numbers 4-5, Pages 293-314
On Rational Trees
Arnaud Carayol and Christophe Morvan
Lecture Notes in Computer Science, 2006, Volume 4207, Computer Science Logic, Pages 225-239
Adding Monotonic Counters to Automata and Transition Graphs
Wong Karianto
Lecture Notes in Computer Science, 2005, Volume 3572, Developments in Language Theory, Pages 187-189
The contextsensitivity bounds of contextsensitive grammars and languages
Franz-Josef Brandenburg
Lecture Notes in Computer Science, 1977, Volume 52, Automata, Languages and Programming, Pages 120-134
2-Visibly Pushdown Automata
Dario Carotenuto, Aniello Murano and Adriano Peron
Lecture Notes in Computer Science, 2007, Volume 4588, Developments in Language Theory, Pages 132-144
An Infinite Automaton Characterization of Double Exponential Time
Salvatore La Torre, P. Madhusudan and Gennaro Parlato
Lecture Notes in Computer Science, 2008, Volume 5213, Computer Science Logic, Pages 33-48
On Alternating Phrase-Structure Grammars
Etsuro Moriya and Friedrich Otto
Lecture Notes in Computer Science, 2008, Volume 5196, Language and Automata Theory and Applications, Pages 397-408
Frequently asked questions General info on journals and books Send us your feedback Impressum Contact us
© Springer, Part of Springer Science+Business Media Privacy, Disclaimer, Terms & Conditions, and Copyright Info