The following pages link to (Q4284250):
Displaying 17 items.
- Streaming algorithms for language recognition problems (Q391078) (← links)
- Conjunctive and Boolean grammars: the true general case of the context-free grammars (Q394967) (← links)
- Leaf languages and string compression (Q550251) (← links)
- Degrees of non-monotonicity for restarting automata (Q861249) (← links)
- Arithmetizing classes around {\textsf{NC}}\(^{1}\) and {\textsf{L}} (Q968272) (← links)
- McNaughton families of languages. (Q1401181) (← links)
- Hardest languages for conjunctive and Boolean grammars (Q1740643) (← links)
- On the closure properties of linear conjunctive languages. (Q1874415) (← links)
- Syntax checking either way (Q2164743) (← links)
- On linear languages recognized by deterministic biautomata (Q2672654) (← links)
- On the Complexity of Membership and Counting in Height-Deterministic Pushdown Automata (Q3503642) (← links)
- A Taxonomy of Deterministic Forgetting Automata (Q3533025) (← links)
- Membership Testing: Removing Extra Stacks from Multi-stack Pushdown Automata (Q3618608) (← links)
- On The Space Complexity Of Turn Bounded Pushdown Automata (Q4709850) (← links)
- On the Transformation of LL(k)-linear Grammars to LL(1)-linear (Q5042255) (← links)
- On the transformation of LL\((k)\)-linear to LL(1)-linear grammars (Q6038708) (← links)
- Syntax checking either way (Q6100187) (← links)
