Pages that link to "Item:Q3901021"
From MaRDI portal
The following pages link to On the Succinctness of Different Representations of Languages (Q3901021):
Displayed 18 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)
- On the number of nonterminals in linear conjunctive grammars (Q596108) (← links)
- Complexity of multi-head finite automata: origins and directions (Q616495) (← links)
- The complexity of finding SUBSEQ\((A)\) (Q839630) (← links)
- On the descriptional power of heads, counters, and pebbles (Q1763719) (← links)
- The chop of languages (Q2358686) (← links)
- One-way reversible multi-head finite automata (Q2358688) (← links)
- Set Automata (Q2814837) (← links)
- SUBLINEARLY SPACE BOUNDED ITERATIVE ARRAYS (Q3056282) (← links)
- Descriptional Complexity of Input-Driven Pushdown Automata (Q3166952) (← links)
- Program Size Complexity of Correction Grammars in the Ershov Hierarchy (Q3188262) (← links)
- NONDETERMINISTIC BIAUTOMATA AND THEIR DESCRIPTIONAL COMPLEXITY (Q5173289) (← links)
- Descriptional Complexity of Two-Way Pushdown Automata with Restricted Head Reversals (Q5200096) (← links)
- NON-RECURSIVE TRADE-OFFS FOR TWO-WAY MACHINES (Q5704375) (← links)
- THE PHENOMENON OF NON-RECURSIVE TRADE-OFFS (Q5704376) (← links)
- A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct (Q6137877) (← links)