When input-driven pushdown automata meet reversiblity

Institut für Informatik, Universität Giessen, Arndtstr. 2, 35392 Giessen, Germany.
kutrib@informatik.uni-giessen.de,malcher@informatik.uni-giessen.de,matthias.wendlandt@informatik.uni-giessen.de

Received: 19 December 2015
Accepted: 3 August 2016

Abstract

We investigate subfamilies of context-free languages that share two important properties. The languages are accepted by input-driven pushdown automata as well as by a reversible pushdown automata. So, the languages are input driven and reversible at the same time. This intersection can be defined on the underlying language families or on the underlying machine classes. It turns out that the latter class is properly included in the former. The relationships between the language families obtained in this way and to reversible context-free languages as well as to input-driven languages are studied. In general, a hierarchical inclusion structure within the real-time deterministic context-free languages is obtained. Finally, the closure properties of these families under the standard operations are investigated and it turns out that all language families introduced are anti-AFLs.