The following pages link to Finite-Turn Pushdown Automata (Q5525346):
Displayed 50 items.
- Descriptional complexity of bounded context-free languages (Q383365) (← links)
- Streaming algorithms for language recognition problems (Q391078) (← links)
- Basic tree transducers (Q579951) (← links)
- Families of languages defined by ciliate bio-operations (Q596126) (← links)
- Familles de langages fermées par crochet ouvert (Q598819) (← links)
- Quasi-rocking real-time pushdown automata (Q650904) (← links)
- Syntactic operators on full semiAFLs (Q758321) (← links)
- Look-ahead removal for total deterministic top-down tree transducers (Q906394) (← links)
- On the power of deep pushdown stacks (Q1037618) (← links)
- On reversal bounded alternating Turing machines (Q1102114) (← links)
- Parallel complexity of logical query programs (Q1104095) (← links)
- On a complexity hierarchy between L and NL (Q1114402) (← links)
- Characterization and closure properties of linear \(\omega\)-languages (Q1127314) (← links)
- A polynomial algorithm testing partial confluence of basic semi-Thue systems (Q1127336) (← links)
- On recursion in ETOL systems (Q1137387) (← links)
- The characterization of parallel ultralinear grammars by rational power series (Q1138387) (← links)
- A pushdown automaton or a context-free grammar - which is more economical? (Q1165026) (← links)
- Nonuniform complexity and the randomness of certain complete languages (Q1184988) (← links)
- The decidability of a mapping problem for generalized sequential machines with final states (Q1216390) (← links)
- One counter languages and the IRS condition (Q1218284) (← links)
- Reversal-bounded multipushdown machines (Q1219160) (← links)
- Familles de langages translatables et fermées par crochet (Q1219565) (← links)
- Uniformly erasable AFL (Q1225462) (← links)
- Context-free grammar forms (Q1226865) (← links)
- Some uniformly erasable families of languages (Q1232299) (← links)
- Control sets on context-free grammar forms (Q1238638) (← links)
- One way finite visit automata (Q1242687) (← links)
- On equivalence and subclass containment problems for deterministic context-free languages (Q1251906) (← links)
- Context-free graph languages of bounded degree are generated by apex graph grammars (Q1338891) (← links)
- Linear graph grammars: Power and complexity (Q1825679) (← links)
- Ambiguity and decision problems for local adjunct languages (Q1843306) (← links)
- Even linear simple matrix languages: formal language properties and grammatical inference. (Q1853536) (← links)
- Relationships between bounded languages, counter machines, finite-index grammars, ambiguity, and commutative regularity (Q1998865) (← links)
- Syntax checking either way (Q2164743) (← links)
- Deterministic input-driven queue automata: finite turns, decidability, and closure properties (Q2344746) (← links)
- Conjunctive grammars and alternating pushdown automata (Q2377302) (← links)
- Finite turns and the regular closure of linear context-free languages (Q2384399) (← links)
- Weighted iterated linear control (Q2422779) (← links)
- Deep pushdown automata (Q2491213) (← links)
- Derivation-bounded languages (Q2533505) (← links)
- Principal AFL (Q2540269) (← links)
- A characterization of context-free languages (Q2549240) (← links)
- Finite-turn checking automata (Q2550634) (← links)
- Substitution and bounded languages (Q2550965) (← links)
- The complexity of ranking simple languages (Q3034844) (← links)
- Boosting Reversible Pushdown Machines by Preprocessing (Q3186586) (← links)
- Kernels of Sub-classes of Context-Free Languages (Q3297763) (← links)
- A PUMPING CONDITION FOR ULTRALINEAR LANGUAGES (Q3401478) (← links)
- Decidable subcases of the equivalence problem for recursive program schemes (Q3773319) (← links)
- Iterated linear control and iterated one-turn pushdowns (Q3776663) (← links)