An undecidable problem for context-free grammars
From MaRDI portal
Recommendations
- Publication:3315498
- A uniform framework for problems on context-free grammars
- Context-freeness of parsing expression languages is undecidable
- A context-free language decision problem
- The Unsolvability of the Recognition of Linear Context-Free Languages
- (Un)decidability of the emptiness problem for multi-dimensional context-free grammars
- Decidability problems in grammar systems
- Context-freeness of the power of context-free languages is undecidable
- Publication:3704908
- Algorithmic decidability of restricted ambiguity in context-free grammars
Cites work
Cited in
(10)- Context-freeness of the power of context-free languages is undecidable
- The undecidability of form equivalence for context-free and EOL forms
- A note on ambiguity in context-free grammars
- Injectivity of the quotient \(h\backslash g\) of two morphisms and ambiguity of linear grammars
- The inherent ambiguity partial algorithm problem for context free languages
- Decidability problems in grammar systems
- Conjunctive grammars over a unary alphabet: Undecidability and unbounded growth
- Automata, Languages and Programming
- Context-freeness of parsing expression languages is undecidable
- Efficient coding of formalized messages
This page was built for publication: An undecidable problem for context-free grammars
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1067789)
