Two-way pushdown automata
From MaRDI portal
Cited in
(28)- Computation with multiple CTCs of fixed length and width
- On inverse deterministic pushdown transductions
- New characterizations of exponential, elementary, and non-elementary time-bounded Turing machines
- Analyzing matching time behavior of backtracking regular expression matchers by using ambiguity of NFA
- A characterization of two-way deterministic classes of languages
- Characterizations of pushdown machines in terms of time-bounded computers
- Writing stack acceptors
- Some open problems in the theory of computation as questions about two-way deterministic pushdown automaton languages
- The theory of languages
- Sweeping input-driven pushdown automata
- The theory of languages
- Automata for analysing service contracts
- Relationships between pushdown automata with counters and complexity classes
- Notes on looping deterministic two-way pushdown automata
- Pushdown automata with counters
- On the determinacy problem for two-way pushdown automata
- Sweeping input-driven pushdown automata
- On the computational power of pushdown automata
- Hierarchies of one-way multihead automata languages
- Yield-languages of two-way pushdown tree automata
- A general theory of translation
- Two-way one-counter nets revisited
- On the existence of generators for certain AFL
- Degree-languages: A new concept of acceptance
- Two-way deterministic multi-weak-counter machines
- Characterizations of transductions defined by abstract families of transducers
- Two-way automata with more than one storage medium
- Writing pushdown acceptors
This page was built for publication: Two-way pushdown automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5551168)
