The following pages link to (Q5541336):
Displaying 26 items.
- Language classes generated by tree controlled grammars with bounded nonterminal complexity (Q443749) (← links)
- On context-free and Szilard languages (Q794440) (← links)
- On bounded interpretations of grammar forms (Q808719) (← links)
- Concerning two-adjacent context-free languages (Q1085985) (← links)
- On commutative context-free languages (Q1092674) (← links)
- Concise description of finite languages (Q1157179) (← links)
- Descriptional complexity of context-free grammar forms (Q1210294) (← links)
- On an extension of the class of context-free languages (Q1276509) (← links)
- Fast deterministic parsers for transition networks (Q1789065) (← links)
- Syntactic complexity of context-free grammars over word monoids (Q1816000) (← links)
- Simulating finite automata with context-free grammars. (Q1853167) (← links)
- Non-erasing Chomsky-Schützenberger theorem with grammar-independent alphabet (Q2280321) (← links)
- On the cover complexity of finite languages (Q2334605) (← links)
- A characterization of context-free languages (Q2549240) (← links)
- Conditional Lindenmayer Systems with Conditions Defined by Bounded Resources (Q2944897) (← links)
- Contextual grammars vs. context-free algebras (Q3318127) (← links)
- Context-Free Languages of Countable Words (Q3393407) (← links)
- (Q3517096) (← links)
- (Q3740261) (← links)
- (Q3761716) (← links)
- (Q3982062) (← links)
- (Q4022014) (← links)
- Context free closed families of languages (Q4323399) (← links)
- Language Classes Generated by Tree Controlled Grammars with Bounded Nonterminal Complexity (Q5200099) (← links)
- (Q5652219) (← links)
- Pareto grammars (Q6621946) (← links)
