DPDA's in ‘atomic normal form’ and applications to equivalence problems
- 31 December 1981
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 14 (2), 155-186
- https://doi.org/10.1016/0304-3975(81)90055-4
Abstract
No abstract availableKeywords
This publication has 27 references indexed in Scilit:
- A representation of trees by languages ITheoretical Computer Science, 1978
- IO and OI. IJournal of Computer and System Sciences, 1977
- On jump-deterministic pushdown automataTheory of Computing Systems, 1977
- Simple context-free languages and free monadic recursion schemesTheory of Computing Systems, 1977
- Equivalence problems for deterministic context-free languages and monadic recursion schemesJournal of Computer and System Sciences, 1977
- Initial Algebra Semantics and Continuous AlgebrasJournal of the ACM, 1977
- Program equivalence and context-free grammarsJournal of Computer and System Sciences, 1975
- On the Parsing of Deterministic LanguagesJournal of the ACM, 1974
- Strict deterministic grammarsJournal of Computer and System Sciences, 1973
- Tree-Manipulating Systems and Church-Rosser TheoremsJournal of the ACM, 1973