Pages that link to "Item:Q4105806"
From MaRDI portal
The following pages link to A note on the succinctness of descriptions of deterministic languages (Q4105806):
Displaying 19 items.
- On the sizes of DPDAs, PDAs, LBAs (Q294936) (← links)
- Descriptional complexity of two-way pushdown automata with restricted head reversals (Q443747) (← links)
- On Goedel speed-up and succinctness of language representations (Q594584) (← links)
- Complexity of multi-head finite automata: origins and directions (Q616495) (← links)
- Lower bounds on the size of deterministic parsers (Q792100) (← links)
- Non-recursive trade-offs between two-dimensional automata and grammars (Q896688) (← links)
- Concise description of finite languages (Q1157179) (← links)
- A pushdown automaton or a context-free grammar - which is more economical? (Q1165026) (← links)
- Why it might pay to assume that languages are infinite (Q1353889) (← links)
- Pushdown automata with bounded nondeterminism and bounded ambiguity (Q1391304) (← links)
- On the descriptional power of heads, counters, and pebbles (Q1763719) (← links)
- Syntax checking either way (Q2164743) (← links)
- In memoriam Chandra Kintala (Q2909177) (← links)
- On reducing the number of stack symbols in a PDA (Q3141998) (← links)
- Pushdown automata with bounded nondeterminism and bounded ambiguity (Q5096344) (← links)
- Descriptional Complexity of Two-Way Pushdown Automata with Restricted Head Reversals (Q5200096) (← links)
- THE PHENOMENON OF NON-RECURSIVE TRADE-OFFS (Q5704376) (← links)
- Syntax checking either way (Q6100187) (← links)
- A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct (Q6137877) (← links)