Monadic recursion schemes: The effect of constants

DOI10.1016/0022-0000(79)90034-5MaRDI QIDQ1259576zbMATH OpenOpenAlexFDO

Authors 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

recursively enumerable languagedecidabilityfamily 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)

Cites work

• scientific article; zbMATH DE number 3229496 (Why is no real title available?)
• scientific article; zbMATH DE number 3322506 (Why is no real title available?)
• A New Normal-Form Theorem for Context-Free Phrase Structure Grammars
• Decidable Properties of Monadic Functional Schemas
• Equivalence problems for deterministic context-free languages and monadic recursion schemes
• Functional schemas with nested predicates
• On Ianov's Program Schemata
• On formalised computer programs
• One-way stack automata
• Program schemes, recursion schemes, and formal languages
• Simple context-free languages and free monadic recursion schemes
• The inclusion problem for simple languages
• Theory of program structures: Schemes, semantics, verification

Cited in

(2)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1259576)