Author:
Bojańczyk Mikołaj,Colcombet Thomas
Publisher
Springer Berlin Heidelberg
Reference6 articles.
1. Aho, A.V., Ullman, J.D.: Translations on a context-free grammar. Information and Control 19(5), 439–475 (1971)
2. Lecture Notes in Computer Science;M. Bojańczyk,2003
3. Engelfriet, J., Hoogeboom, H.J.: Tree-walking pebble automata. In: Paum, G., Karhumaki, J., Maurer, H., Rozenberg, G. (eds.) Jewels are forever, contributions to Theoretical Computer Science in honor of Arto Salomaa, pp. 72–83. Springer, Heidelberg (1999)
4. Engelfriet, J., Hoogeboom, H.J., van Best, J.-P.: Trips on trees. Acta Cybernetica 14, 51–64 (1999)
5. Kamimura, T., Slutzki, G.: Parallel two-way automata on directed ordered acyclic graphs. Information and Control 49(1), 10–51 (1981)
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. An Automata-Theoretic Approach to Infinite-State Systems;Time for Verification;2010
2. Nested Sibling Tree Automata;RAIRO - Theoretical Informatics and Applications;2009-03-12
3. Automata for XML—A survey;Journal of Computer and System Sciences;2007-05
4. Complementing deterministic tree-walking automata;Information Processing Letters;2006-07
5. Nested Pebbles and Transitive Closure;STACS 2006;2006