Formal languages
Learning approximately regular languages with reversible languages
Theoretical Computer Science
Inference of Reversible Languages
Journal of the ACM (JACM)
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Introduction to Formal Language Theory
Introduction to Formal Language Theory
The theory of parsing, translation, and compiling
The theory of parsing, translation, and compiling
On the Construction of Reversible Automata for Reversible Languages
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
LATIN '92 Proceedings of the 1st Latin American Symposium on Theoretical Informatics
Introduction to reversible computing: motivation, progress, and challenges
Proceedings of the 2nd conference on Computing frontiers
Identification of biRFSA languages
Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
Reversible computing and cellular automata—A survey
Theoretical Computer Science
On the efficient construction of quasi-reversible automata for reversible languages
Information Processing Letters
Fast reversible language recognition using cellular automata
Information and Computation
Reversible Flowchart Languages and the Structured Reversible Program Theorem
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Introduction to Automata Theory, Languages, and Computation
Introduction to Automata Theory, Languages, and Computation
On locally reversible languages
Theoretical Computer Science
Irreversibility and heat generation in the computing process
IBM Journal of Research and Development
Logical reversibility of computation
IBM Journal of Research and Development
Real-time reversible iterative arrays
Theoretical Computer Science
Reversible Computation and Reversible Programming Languages
Electronic Notes in Theoretical Computer Science (ENTCS)
RC'13 Proceedings of the 5th international conference on Reversible Computation
| Hi-index | 0.00 |
Reversible pushdown automata are deterministic pushdown automata that are also backward deterministic. Therefore, they have the property that any configuration occurring in any computation has exactly one predecessor. In this paper, the computational capacity of reversible computations in pushdown automata is investigated and turns out to lie properly in between the regular and deterministic context-free languages. Furthermore, it is shown that a deterministic context-free language cannot be accepted reversibly if more than realtime is necessary for acceptance. Closure properties as well as decidability questions for reversible pushdown automata are studied. Finally, we show that the problem to decide whether a given nondeterministic or deterministic pushdown automaton is reversible is P-complete, whereas it is undecidable whether the language accepted by a given nondeterministic pushdown automaton is reversible.