The following pages link to (Q3890112):
Displayed 50 items.
- Conjunctive and Boolean grammars: the true general case of the context-free grammars (Q394967) (← links)
- Descriptional complexity of unambiguous input-driven pushdown automata (Q484313) (← links)
- Toward a theory of input-driven locally parsable languages (Q728273) (← links)
- Model-checking structured context-free languages (Q832277) (← links)
- Sofic-Dyck shifts (Q897881) (← links)
- Arithmetizing classes around {\textsf{NC}}\(^{1}\) and {\textsf{L}} (Q968272) (← links)
- Generalizing input-driven languages: theoretical and practical benefits (Q1706605) (← links)
- Hardest languages for conjunctive and Boolean grammars (Q1740643) (← links)
- Operator precedence and the visibly pushdown property (Q1757840) (← links)
- Counting paths in VPA is complete for \(\#\mathrm{NC}^1\) (Q1759656) (← links)
- Grammatical characterizations of NPDAs and VPDAs with counters (Q1784750) (← links)
- P-hardness of the emptiness problem for visibly pushdown languages (Q1944895) (← links)
- Additive number theory via automata theory (Q1987517) (← links)
- Consensus string problem for multiple regular languages (Q2042725) (← links)
- Weighted operator precedence languages (Q2064530) (← links)
- On the determinization of event-clock input-driven pushdown automata (Q2097230) (← links)
- Deciding path size of nondeterministic (and input-driven) pushdown automata (Q2098178) (← links)
- Input-driven pushdown automata on well-nested infinite strings (Q2117102) (← links)
- On the power of pushing or stationary moves for input-driven pushdown automata (Q2164744) (← links)
- Beyond operator-precedence grammars and languages (Q2186819) (← links)
- On the overlap assembly of strings and languages (Q2311303) (← links)
- Deterministic input-driven queue automata: finite turns, decidability, and closure properties (Q2344746) (← links)
- State complexity of operations on input-driven pushdown automata (Q2396831) (← links)
- Input-driven languages are linear conjunctive (Q2634670) (← links)
- Tinput-Driven Pushdown Automata (Q2945881) (← links)
- Locally Chain-Parsable Languages (Q2946332) (← links)
- Visibly Counter Languages and the Structure of $$\mathrm {NC}^{1}$$ (Q2946409) (← links)
- Conjunctive Visibly-Pushdown Path Queries (Q2947891) (← links)
- Edit-Distance Between Visibly Pushdown Languages (Q2971150) (← links)
- Descriptional Complexity of Input-Driven Pushdown Automata (Q3166952) (← links)
- Synchronization of Regular Automata (Q3182910) (← links)
- On Distinguishing NC $$^1$$ and NL (Q3451114) (← links)
- On the Complexity of Membership and Counting in Height-Deterministic Pushdown Automata (Q3503642) (← links)
- Membership Testing: Removing Extra Stacks from Multi-stack Pushdown Automata (Q3618608) (← links)
- On the time and space complexity of computation using write-once memory or is pen really much worse than pencil? (Q4000866) (← links)
- (Q5016361) (← links)
- (Q5016364) (← links)
- Digging input-driven pushdown automata (Q5021110) (← links)
- (Q5089200) (← links)
- (Q5101344) (← links)
- Weighted Operator Precedence Languages (Q5111245) (← links)
- Queue Automata: Foundations and Developments (Q5112182) (← links)
- State Complexity of the Quotient Operation on Input-Driven Pushdown Automata (Q5205050) (← links)
- (Q5216306) (← links)
- Ramsey-Based Inclusion Checking for Visibly Pushdown Automata (Q5277899) (← links)
- Input-driven multi-counter automata (Q5918274) (← links)
- Input-driven pushdown automata for edit distance neighborhood (Q5918675) (← links)
- Further closure properties of input-driven pushdown automata (Q5919707) (← links)
- Edit distance neighbourhoods of input-driven pushdown automata (Q5920061) (← links)
- Edit distance neighbourhoods of input-driven pushdown automata (Q5920214) (← links)