Pages that link to "Item:Q1067789"
From MaRDI portal
The following pages link to An undecidable problem for context-free grammars (Q1067789):
Displaying 10 items.
- A note on ambiguity in context-free grammars (Q911784) (← links)
- The undecidability of form equivalence for context-free and EOL forms (Q1069311) (← links)
- Decidability problems in grammar systems (Q1285581) (← links)
- Efficient coding of formalized messages (Q1816135) (← links)
- Context-freeness of the power of context-free languages is undecidable (Q1826642) (← links)
- Conjunctive grammars over a unary alphabet: Undecidability and unbounded growth (Q2268341) (← links)
- Injectivity of the quotient \(h\backslash g\) of two morphisms and ambiguity of linear grammars (Q2708470) (← links)
- Context-Freeness of Parsing Expression Languages is Undecidable (Q5384531) (← links)
- The inherent ambiguity partial algorithm problem for context free languages (Q5402501) (← links)
- Automata, Languages and Programming (Q5716767) (← links)