The following pages link to (Q5583856):
Displaying 44 items.
- Conjunctive and Boolean grammars: the true general case of the context-free grammars (Q394967) (← links)
- Descriptional complexity of two-way pushdown automata with restricted head reversals (Q443747) (← links)
- The language intersection problem for non-recursive context-free grammars (Q596298) (← links)
- Complexity of multi-head finite automata: origins and directions (Q616495) (← links)
- Lower bounds on the size of deterministic parsers (Q792100) (← links)
- Unresolved systems of language equations: expressive power and decision problems (Q817804) (← links)
- The complexity of finding SUBSEQ\((A)\) (Q839630) (← links)
- Regulated nondeterminism in pushdown automata (Q840763) (← links)
- Real-time reversible iterative arrays (Q846369) (← links)
- Boundary sets of regular and context-free languages (Q896680) (← links)
- Decision problems for language equations (Q972384) (← links)
- Independence results about context-free languages and lower bounds (Q1071500) (← links)
- The finite power property for context-free languages (Q1157912) (← links)
- The complexity of computing the number of strings of given length in context-free languages (Q1178713) (← links)
- Reversal-bounded multipushdown machines (Q1219160) (← links)
- The Turing degree of the inherent ambiguity problem for context-free languages (Q1220391) (← links)
- An alternative approach to the improvement of LR(k) parsers (Q1238428) (← links)
- The inclusion problem for some subclasses of context-free languages (Q1978515) (← links)
- On the degrees of non-regularity and non-context-freeness (Q2009649) (← links)
- Decision problems and projection languages for restricted variants of two-dimensional automata (Q2029491) (← links)
- Language equations (Q2074222) (← links)
- String assembling systems: comparison to sticker systems and decidability (Q2152089) (← links)
- Syntax checking either way (Q2164743) (← links)
- Computational completeness of equations over sets of natural numbers (Q2252522) (← links)
- Conjunctive grammars over a unary alphabet: Undecidability and unbounded growth (Q2268341) (← links)
- Deterministic input-driven queue automata: finite turns, decidability, and closure properties (Q2344746) (← links)
- The chop of languages (Q2358686) (← links)
- Some definitional suggestions for automata theory (Q2529464) (← links)
- The use of lists in the study of undecidable problems in automata theory (Q2551463) (← links)
- Tinput-Driven Pushdown Automata (Q2945881) (← links)
- The complexity of ranking simple languages (Q3034844) (← links)
- Two-Party Watson-Crick Computations (Q3073638) (← links)
- (Q3657451) (← links)
- (Q4988162) (← links)
- Space Complexity of Stack Automata Models (Q5041255) (← links)
- Queue Automata: Foundations and Developments (Q5112182) (← links)
- Self-Verifying Pushdown and Queue Automata (Q5164866) (← links)
- One-Time Nondeterministic Computations (Q5205043) (← links)
- State Complexity of the Quotient Operation on Input-Driven Pushdown Automata (Q5205050) (← links)
- Diving into the queue (Q5223609) (← links)
- Pushdown automata and constant height: decidability and bounds (Q6042073) (← links)
- Syntax checking either way (Q6100187) (← links)
- Space Complexity of Stack Automata Models (Q6169902) (← links)
- Descriptional complexity of finite automata -- selected highlights (Q6614536) (← links)
