A representation of trees by languages II
- 31 December 1978
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 7 (1) , 25-55
- https://doi.org/10.1016/0304-3975(78)90039-7
Abstract
No abstract availableKeywords
This publication has 19 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
- Un théorème de duplication pour les forêts algébriquesJournal of Computer and System Sciences, 1976
- Completeness results for the equivalence of recursive schemasJournal of Computer and System Sciences, 1976
- The inclusion problem for simple languagesTheoretical Computer Science, 1976
- IO and OIDAIMI Report Series, 1975
- Bottom-up and top-down tree transformations— a comparisonTheory of Computing Systems, 1975
- Recursive schemes, algebraic trees and deterministic languagesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1974
- Tree acceptors and some of their applicationsJournal of Computer and System Sciences, 1970
- Grammars with macro-like productionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1968