Simple context-free languages and free monadic recursion schemes

DOI10.1007/BF01768465MaRDI QIDQ4139703zbMATH OpenFDO

Authors Emily P. Friedman

Publication date 1977

Published in Mathematical Systems Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01768465

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

• A regularity test for pushdown machines
• Decidable Properties of Monadic Functional Schemas
• Deterministic context free languages
• Deterministic one-counter automata
• Equivalence problems for deterministic context-free languages and monadic recursion schemes
• Finite-Turn Pushdown Automata
• Program schemes, recursion schemes, and formal languages
• Properties of deterministic top-down grammars
• Regularity and Related Problems for Deterministic Pushdown Automata
• Strict deterministic grammars

Cited in

(4)

• Superdeterministic DPDAs: The method of accepting does affect decision problems
• DPDA's in 'Atomic normal form' and applications to equivalence problems
• On equivalence and subclass containment problems for deterministic context-free languages
• Monadic recursion schemes: The effect of constants

This page was built for publication: Simple context-free languages and free monadic recursion schemes

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