Pages that link to "Item:Q1826642"
From MaRDI portal
The following pages link to Context-freeness of the power of context-free languages is undecidable (Q1826642):
Displaying 8 items.
- An undecidable problem for context-free grammars (Q1067789) (← links)
- (Q3771647) (← links)
- (Q4436372) (← links)
- If a DOL language is k-power free then it is circular (Q4630287) (← links)
- Squares of regular languages (Q4680378) (← links)
- Context-Freeness of Parsing Expression Languages is Undecidable (Q5384531) (← links)
- UNSOLVABILITY LEVELS OF OPERATION PROBLEMS FOR SUBCLASSES OF CONTEXT-FREE LANGUAGES (Q5462115) (← links)
- Implementation and Application of Automata (Q5464010) (← links)