The following pages link to Two-way pushdown automata (Q5551168):
Displaying 24 items.
- Computation with multiple CTCs of fixed length and width (Q256423) (← links)
- Two-way automata with more than one storage medium (Q1083206) (← links)
- Hierarchies of one-way multihead automata languages (Q1099645) (← links)
- Two-way deterministic multi-weak-counter machines (Q1165028) (← links)
- Degree-languages: A new concept of acceptance (Q1236888) (← links)
- On inverse deterministic pushdown transductions (Q1245575) (← links)
- Notes on looping deterministic two-way pushdown automata (Q1318758) (← links)
- On the determinacy problem for two-way pushdown automata (Q1342261) (← links)
- Yield-languages of two-way pushdown tree automata (Q1352013) (← links)
- Writing pushdown acceptors (Q2540271) (← links)
- On the existence of generators for certain AFL (Q2541640) (← links)
- On the computational power of pushdown automata (Q2542990) (← links)
- A characterization of two-way deterministic classes of languages (Q2547802) (← links)
- Pushdown automata with counters (Q2554231) (← links)
- Writing stack acceptors (Q2554233) (← links)
- Automata for Analysing Service Contracts (Q2811923) (← links)
- Analyzing Matching Time Behavior of Backtracking Regular Expression Matchers by Using Ambiguity of NFA (Q2830233) (← links)
- Relationships between pushdown automata with counters and complexity classes (Q4118823) (← links)
- Some open problems in the theory of computation as questions about two-way deterministic pushdown automaton languages (Q4128015) (← links)
- The theory of languages (Q5551468) (← links)
- A general theory of translation (Q5563368) (← links)
- The theory of languages (Q5592247) (← links)
- Characterizations of transductions defined by abstract families of transducers (Q5626546) (← links)
- New characterizations of exponential, elementary, and non-elementary time-bounded Turing machines (Q6040662) (← links)
