When input-driven pushdown automata meet reversiblity
From MaRDI portal
Publication:2969982
Recommendations
- Reversible pushdown automata
- Reversible pushdown automata
- Pushdown automata with reversal-bounded counters
- Deterministic Input-Reversal and Input-Revolving Finite Automata
- scientific article; zbMATH DE number 2086620
- Developments in Language Theory
- Input-Driven Pushdown Automata with Limited Nondeterminism
- Equivalence of deterministic pushdown automata revisited
- Concise representations of reversible automata
- Concise representations of reversible automata
Cites work
- scientific article; zbMATH DE number 3885334 (Why is no real title available?)
- scientific article; zbMATH DE number 3639163 (Why is no real title available?)
- A simple and efficient universal reversible Turing machine
- Adding nesting structure to words
- Aspects of reversibility for classical automata
- Deterministic input-driven queue automata: finite turns, decidability, and closure properties
- Developments in Language Theory
- Fast reversible language recognition using cellular automata
- Input-driven stack automata
- Irreversibility and Heat Generation in the Computing Process
- Logical Reversibility of Computation
- Minimizing Variants of Visibly Pushdown Automata
- Nondeterministic state complexity of nested word automata
- One-way reversible multi-head finite automata
- Operational state complexity of nested word automata
- Operator precedence and the visibly pushdown property
- Real-time reversible iterative arrays
- Real-time reversible one-way cellular automata
- Reversible computing and cellular automata -- a survey
- Reversible multi-head finite automata characterize reversible logarithmic space
- Reversible pushdown automata
- Reversible simulation of one-dimensional irreversible cellular automata
- Reversible space equals deterministic space
- State complexity of operations on input-driven pushdown automata
- The tree width of auxiliary storage
- Tinput-Driven Pushdown Automata
- Two-way reversible multi-head finite automata
- Visibly pushdown languages
- When Church-Rosser becomes context free
Cited in
(8)- On input-revolving deterministic and nondeterministic finite automata
- Reversible parallel communicating finite automata systems
- scientific article; zbMATH DE number 3885334 (Why is no real title available?)
- Input-driven languages are linear conjunctive
- Input-driven double-head pushdown automata
- Developments in Language Theory
- Pushdown automata with reversal-bounded counters
- Boosting reversible pushdown and queue machines by preprocessing
This page was built for publication: When input-driven pushdown automata meet reversiblity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2969982)
