Pages that link to "Item:Q5518369"
From MaRDI portal
The following pages link to Preservation of unambiguity and inherent ambiguity in context-free languages (Q5518369):
Displaying 11 items.
- Conjunctive and Boolean grammars: the true general case of the context-free grammars (Q394967) (← links)
- On the unambiguity of n-tuple languages (Q1218730) (← links)
- A quasi-polynomial-time algorithm for sampling words from a context-free language (Q1363787) (← links)
- Structure des grammaires d'ambiguite bornee (Q2264417) (← links)
- BOOLEAN GRAMMARS AND GSM MAPPINGS (Q3056280) (← links)
- HOMOMORPHISMS PRESERVING DETERMINISTIC CONTEXT-FREE LANGUAGES (Q5495419) (← links)
- The theory of languages (Q5551468) (← links)
- The theory of languages (Q5592247) (← links)
- The hardest language for grammars with context operators (Q6038689) (← links)
- Non-closure under complementation for unambiguous linear grammars (Q6040667) (← links)
- \(\mathrm{GF}(2)\)-operations on basic families of formal languages (Q6204546) (← links)