Simple context-free languages and free monadic recursion schemes
From MaRDI portal
Publication:4139703
DOI10.1007/BF01768465zbMath0364.68076MaRDI QIDQ4139703
Publication date: 1977
Published in: Mathematical Systems Theory (Search for Journal in Brave)
Related Items (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
Cites Work
- Deterministic one-counter automata
- Equivalence problems for deterministic context-free languages and monadic recursion schemes
- Program schemes, recursion schemes, and formal languages
- Strict deterministic grammars
- Decidable Properties of Monadic Functional Schemas
- Regularity and Related Problems for Deterministic Pushdown Automata
- Deterministic context free languages
- Finite-Turn Pushdown Automata
- A regularity test for pushdown machines
- Properties of deterministic top-down grammars
This page was built for publication: Simple context-free languages and free monadic recursion schemes
