Pages that link to "Item:Q5569456"
From MaRDI portal
The following pages link to On the equivalence and containment problems for context-free languages (Q5569456):
Displaying 10 items.
- Conjunctive and Boolean grammars: the true general case of the context-free grammars (Q394967) (← links)
- On the rational subset problem for groups. (Q875109) (← links)
- Observations on the complexity of regular expression problems (Q1149249) (← links)
- There does not exist an enumerable family of context-free grammars that generates the class of single-valued languages (Q1177785) (← links)
- On the equivalence, containment, and covering problems for the regular and context-free languages (Q1229100) (← links)
- On equivalence of grammars through transformation trees (Q1259173) (← links)
- A theoretical framework for cardinality-based feature models: the semantics and computational aspects (Q1647962) (← links)
- Theory of formal grammars (Q1846334) (← links)
- The Inclusion Problem of Context-Free Languages: Some Tractable Cases (Q3637217) (← links)
- A subclass of deterministic context-free languages with a decidable inclusion problem (Q4007469) (← links)
