Fundamental properties of infinite trees
- 25 March 1983
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 25 (2), 95-169
- https://doi.org/10.1016/0304-3975(83)90059-2
Abstract
No abstract availableKeywords
This publication has 58 references indexed in Scilit:
- Definable operations in general algebras, and the theory of automata and flowchartsPublished by Springer Nature ,2006
- DPDA's in ‘atomic normal form’ and applications to equivalence problemsTheoretical Computer Science, 1981
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting SystemsJournal of the ACM, 1980
- A representation of trees by languages ITheoretical Computer Science, 1978
- On some classes of interpretationsJournal of Computer and System Sciences, 1978
- On jump-deterministic pushdown automataTheory of Computing Systems, 1977
- Scalar and vector iterationJournal of Computer and System Sciences, 1977
- The existence and construction of free iterative theoriesJournal of Computer and System Sciences, 1976
- Program equivalence and context-free grammarsJournal of Computer and System Sciences, 1975
- Tree-Manipulating Systems and Church-Rosser TheoremsJournal of the ACM, 1973