Pages that link to "Item:Q3086239"
From MaRDI portal
The following pages link to THE INCLUSION PROBLEM OF CONTEXT-FREE LANGUAGES: SOME TRACTABLE CASES (Q3086239):
Displaying 3 items.
- Inclusion between the frontier language of a non-deterministic recursive program scheme and the Dyck language is undecidable (Q2422040) (← links)
- The inherent ambiguity partial algorithm problem for context free languages (Q5402501) (← links)
- Visibly pushdown transducers with well-nested outputs (Q5890815) (← links)