An axiomatic approach to the Korenjak-Hopcroft algorithms
- 1 December 1983
- journal article
- research article
- Published by Springer Nature in Theory of Computing Systems
- Vol. 16 (1) , 191-231
- https://doi.org/10.1007/bf01744577
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Fundamental properties of infinite treesTheoretical Computer Science, 1983
- Equivalence problems for mappings on infinite stringsInformation and Control, 1981
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting SystemsJournal of the ACM, 1980
- Infinite trees in normal form and recursive equations having a unique solutionTheory of Computing Systems, 1979
- A representation of trees by languages ITheoretical Computer Science, 1978
- Completeness results for the equivalence of recursive schemasJournal of Computer and System Sciences, 1976
- A system which automatically improves programsActa Informatica, 1976
- Une forme canonique pour les grammaires simples déterministesRevue française d'automatique informatique recherche opérationnelle. Informatique théorique, 1974
- Strict deterministic grammarsJournal of Computer and System Sciences, 1973
- Tree-Manipulating Systems and Church-Rosser TheoremsJournal of the ACM, 1973