Tree pushdown automata
- 1 February 1985
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 30 (1) , 25-40
- https://doi.org/10.1016/0022-0000(85)90002-9
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- DPDA's in ‘atomic normal form’ and applications to equivalence problemsTheoretical Computer Science, 1981
- IO and OI. IJournal of Computer and System Sciences, 1977
- Completeness results for the equivalence of recursive schemasJournal of Computer and System Sciences, 1976
- Tree acceptors and some of their applicationsJournal of Computer and System Sciences, 1970
- Nested Stack AutomataJournal of the ACM, 1969
- Grammars with macro-like productionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1968
- Characterizing derivation trees of context-free grammars through a generalization of finite automata theoryJournal of Computer and System Sciences, 1967
- On the translation of languages from left to rightInformation and Control, 1965
- On certain formal properties of grammarsInformation and Control, 1959