Pushdown tree automata
- 1 December 1983
- journal article
- research article
- Published by Springer Nature in Theory of Computing Systems
- Vol. 16 (1) , 237-263
- https://doi.org/10.1007/bf01744582
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- DPDA's in ‘atomic normal form’ and applications to equivalence problemsTheoretical Computer Science, 1981
- Algebraic semanticsLecture Notes in Computer Science, 1981
- Une propri\'et\'e des forêts alg\'ebriques « de greibach \raInformation and Control, 1980
- Transductions and Context-Free LanguagesPublished by Springer Nature ,1979
- Tree-oriented proofs of some theorems on context-free and indexed languagesPublished by Association for Computing Machinery (ACM) ,1970
- Nested Stack AutomataJournal of the ACM, 1969
- Indexed Grammars—An Extension of Context-Free GrammarsJournal of the ACM, 1968
- Grammars with macro-like productionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1968