Monadic recursion schemes: The effect of constants

DOI10.1016/0022-0000(79)90034-5zbMath0411.03010OpenAlexW2046796873MaRDI QIDQ1259576

Emily P. Friedman, Sheila A. Greibach

Publication date: 1979

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(79)90034-5

zbMATH Keywords

decidabilityrecursively enumerable languagefamily of value languagesmonadic recursion scheme with constants

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Decidability of theories and sets of sentences (03B25) Applications of computability and recursion theory (03D80)

Related Items (2)

The complexity of monadic recursion schemes: executability problems, nesting depth, and applications ⋮ The complexity of monadic recursion schemes: Exponential time bounds

Cites Work

• Unnamed Item
• Unnamed Item
• Theory of program structures: Schemes, semantics, verification
• The inclusion problem for simple languages
• Equivalence problems for deterministic context-free languages and monadic recursion schemes
• Program schemes, recursion schemes, and formal languages
• On formalised computer programs
• Decidable Properties of Monadic Functional Schemas
• Functional schemas with nested predicates
• Simple context-free languages and free monadic recursion schemes
• A New Normal-Form Theorem for Context-Free Phrase Structure Grammars
• One-way stack automata
• On Ianov's Program Schemata

This page was built for publication: Monadic recursion schemes: The effect of constants