Monadic recursion schemes: The effect of constants
- 1 June 1979
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 18 (3) , 254-266
- https://doi.org/10.1016/0022-0000(79)90034-5
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- 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
- The inclusion problem for simple languagesTheoretical Computer Science, 1976
- Functional schemas with nested predicatesInformation and Control, 1975
- Decidable Properties of Monadic Functional SchemasJournal of the ACM, 1973
- Program schemes, recursion schemes, and formal languagesJournal of Computer and System Sciences, 1973
- On formalised computer programsJournal of Computer and System Sciences, 1970
- One-way stack automataJournal of the ACM, 1967
- A New Normal-Form Theorem for Context-Free Phrase Structure GrammarsJournal of the ACM, 1965
- On Ianov's Program SchemataJournal of the ACM, 1964