A representation of trees by languages I
- 31 December 1978
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 6 (3), 255-279
- https://doi.org/10.1016/0304-3975(78)90008-7
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- On jump-deterministic pushdown automataTheory 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
- The inclusion problem for simple languagesTheoretical Computer Science, 1976
- Program equivalence and context-free grammarsJournal of Computer and System Sciences, 1975
- Bottom-up and top-down tree transformations— a comparisonTheory of Computing Systems, 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
- On context-free languages and push-down automataInformation and Control, 1963