Journalartikel

Reversible pushdown automata


AutorenlisteKutrib, Martin; Malcher, Andreas

Jahr der Veröffentlichung2012

Seiten1814-1827

ZeitschriftJournal of Computer and System Sciences

Bandnummer78

Heftnummer6

ISSN0022-0000

eISSN1090-2724

Open Access StatusBronze

DOI Linkhttps://doi.org/10.1016/j.jcss.2011.12.004

VerlagElsevier


Abstract
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. (c) 2011 Elsevier Inc. All rights reserved.



Zitierstile

Harvard-ZitierstilKutrib, M. and Malcher, A. (2012) Reversible pushdown automata, Journal of Computer and System Sciences, 78(6), pp. 1814-1827. https://doi.org/10.1016/j.jcss.2011.12.004

APA-ZitierstilKutrib, M., & Malcher, A. (2012). Reversible pushdown automata. Journal of Computer and System Sciences. 78(6), 1814-1827. https://doi.org/10.1016/j.jcss.2011.12.004



Schlagwörter


Closure propertiesDecidability QuestionsFormal languagesLANGUAGESPushdown automataReversible computations


Nachhaltigkeitsbezüge


Zuletzt aktualisiert 2025-10-06 um 10:08