Some non-semi-decidability problems for linear and deterministic context-free languages
From MaRDI portal
Recommendations
- UNSOLVABILITY LEVELS OF OPERATION PROBLEMS FOR SUBCLASSES OF CONTEXT-FREE LANGUAGES
- Context-freeness of the power of context-free languages is undecidable
- Height functions and linear languages
- Decidability of operation problems for T0L languages and subclasses
- Undecidability of Operation Problems for T0L Languages and Subclasses
Cited in
(6)- A note on: `Deque automata and a subfamily of context-sensitive languages which contains all semilinear bounded languages' (by K. Ayers)
- Context-freeness of the power of context-free languages is undecidable
- Semilinearity and Context-Freeness of Languages Accepted by Valence Automata
- Undecidability of Operation Problems for T0L Languages and Subclasses
- UNSOLVABILITY LEVELS OF OPERATION PROBLEMS FOR SUBCLASSES OF CONTEXT-FREE LANGUAGES
- Height functions and linear languages
This page was built for publication: Some non-semi-decidability problems for linear and deterministic context-free languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5464010)