The following pages link to Bracketed context-free languages (Q2525996):
Displaying 23 items.
- The strong equivalence of ET0L grammars (Q287052) (← links)
- Structural equivalence and ET0L grammars (Q671426) (← links)
- Decidability of structural equivalence of E0L grammars (Q807023) (← links)
- Sofic-Dyck shifts (Q897881) (← links)
- Context-free grammars with cancellation properties (Q1080662) (← links)
- Testing for grammatical coverings (Q1080663) (← links)
- Nest sets and relativized closure properties (Q1170892) (← links)
- Uniformly erasable AFL (Q1225462) (← links)
- The validation of SGML content models (Q1370524) (← links)
- Decidability of EDT0L structural equivalence (Q1605312) (← links)
- Theory of formal grammars (Q1846334) (← links)
- The word problem for visibly pushdown languages described by grammars (Q2461562) (← links)
- Characterizing derivation trees of context-free grammars through a generalization of finite automata theory (Q2526960) (← links)
- Structural equivalence of context-free grammars (Q2534284) (← links)
- Input-driven languages are linear conjunctive (Q2634670) (← links)
- Bracketed contextual grammars (Q2723549) (← links)
- Context-Free Ambiguity Detection Using Multi-stack Pushdown Automata (Q2817371) (← links)
- (Q3335013) (← links)
- (Q3899528) (← links)
- Covering-languages of grammars (Q4769996) (← links)
- Deterministic regular languages (Q5096780) (← links)
- One-unambiguous regular languages (Q5906297) (← links)
- One-unambiguous regular languages (Q5906893) (← links)