When input-driven pushdown automata meet reversiblity
From MaRDI portal
Publication:2969982
DOI10.1051/ITA/2016016zbMATH Open1362.68149OpenAlexW2519069132MaRDI QIDQ2969982FDOQ2969982
Authors: Martin Kutrib, Andreas Malcher, Matthias Wendlandt 
Publication date: 24 March 2017
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1051/ita/2016016
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
- Title not available (Why is that?)
- Visibly pushdown languages
- Irreversibility and Heat Generation in the Computing Process
- Logical Reversibility of Computation
- Reversible computing and cellular automata -- a survey
- Adding nesting structure to words
- A simple and efficient universal reversible Turing machine
- One-Way Reversible Multi-head Finite Automata
- Title not available (Why is that?)
- State complexity of operations on input-driven pushdown automata
- Operational state complexity of nested word automata
- Developments in Language Theory
- Two-way reversible multi-head finite automata
- The tree width of auxiliary storage
- Nondeterministic state complexity of nested word automata
- Minimizing Variants of Visibly Pushdown Automata
- Reversible simulation of one-dimensional irreversible cellular automata
- Operator precedence and the visibly pushdown property
- Tinput-Driven Pushdown Automata
- Reversible pushdown automata
- Aspects of Reversibility for Classical Automata
- Real-Time Reversible One-Way Cellular Automata
- Real-time reversible iterative arrays
- Fast reversible language recognition using cellular automata
- Reversible space equals deterministic space
- When Church-Rosser becomes context free
- Deterministic input-driven queue automata: finite turns, decidability, and closure properties
- Reversible multi-head finite automata characterize reversible logarithmic space
- Input-driven stack automata
Cited In (6)
- Developments in Language Theory
- Boosting Reversible Pushdown and Queue Machines by Preprocessing
- Pushdown automata with reversal-bounded counters
- Reversible parallel communicating finite automata systems
- On input-revolving deterministic and nondeterministic finite automata
- Title not available (Why is that?)
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)
