RAIRO-Theor. Inf. Appl.
Volume 50, Number 4, October-December 20167th Non-Classical Models of Automata and Applications (NCMA-2015)
|Page(s)||313 - 330|
|Published online||16 September 2016|
When input-driven pushdown automata meet reversiblity
Accepted: 3 August 2016
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.
Mathematics Subject Classification: 68Q45 / 68Q68
Key words: Reversible computation / input-driven pushdown automata / formal languages / closure properties
© EDP Sciences 2016
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.