Reversible pushdown automata

Authors:
Martin Kutrib;Andreas Malcher
Affiliations:
Institut für Informatik, Universität Giessen, Giessen, Germany;Institut für Informatik, Universität Giessen, Giessen, Germany
Venue:
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Year:
2010

Citing 7
Cited 5

Formal languages

Formal languages
Inference of Reversible Languages

Journal of the ACM (JACM)
Introduction to Formal Language Theory

Introduction to Formal Language Theory
On Reversible Automata

LATIN '92 Proceedings of the 1st Latin American Symposium on Theoretical Informatics
Fast reversible language recognition using cellular automata

Information and Computation
Logical reversibility of computation

IBM Journal of Research and Development
Real-time reversible iterative arrays

Theoretical Computer Science

A simple and efficient universal reversible turing machine

LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Reversible multi-head finite automata characterize reversible logarithmic space

LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Two-Way Reversible Multi-Head Finite Automata

Fundamenta Informaticae - Theory that Counts: To Oscar Ibarra on His 70th Birthday
Input-Driven stack automata

TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
Time-Symmetric machines

RC'13 Proceedings of the 5th international conference on Reversible Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Reversible pushdown automata are deterministic pushdown automata having 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 can be 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, the question of whether a given (nondeterministic) pushdown automaton can be algorithmically tested for reversibility is answered in the affirmative, whereas it is shown to be undecidable whether the language accepted by a given nondeterministic pushdown automaton is reversible.