Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. Achim Blumensath and Erich Grädel. Automatic structures. In Proceedings of LICS’ 00, pages 51–62. IEEE Computer Society Press, 2000.
2. Walter S. Brainerd. Tree generating regular systems. Information and Control, 14:217–231, 1969.
3. Lect Notes Comput Sci;D. Caucal,1996
4. J.L. Coquidé, M. Dauchet, R. Gilleron, and S. Vágvölgyi. Bottom-up tree pushdown automata: Classification and connection with rewrite systems. Theoretical Computer Science, 127(1):69–98, 1994.
5. Lect Notes Comput Sci;J.L. Coquidé,1990
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Recurrent Reachability Analysis in Regular Model Checking;Logic for Programming, Artificial Intelligence, and Reasoning;2008
2. An Extension of Pushdown System and Its Model Checking Method;CONCUR 2003 - Concurrency Theory;2003
3. Transition Graphs of Rewriting Systems over Unranked Trees;Mathematical Foundations of Computer Science 2007
4. A Unified View of Tree Automata and Term Schematisations;Fifth Ifip International Conference On Theoretical Computer Science – Tcs 2008