Degrees of Reversibility for DFA and DPDA

DOI10.1007/978-3-319-08494-7_4zbMath1416.68104OpenAlexW155982404MaRDI QIDQ3188913

Thomas Worsch, Martin Kutrib

Publication date: 2 September 2014

Published in: Reversible Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-08494-7_4

zbMATH Keywords

pushdown automatalookaheadgradual reversibilityhierarchies of languagesreversible finite state machines

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (9)

Reversible top-down syntax analysis ⋮ Aspects of Reversibility for Classical Automata ⋮ Reversible Limited Automata ⋮ Reversible and Irreversible Computations of Deterministic Finite-State Devices ⋮ Weakly and Strongly Irreversible Regular Languages ⋮ Reversible Top-Down Syntax Analysis ⋮ Unnamed Item ⋮ Concise Representations of Reversible Automata ⋮ Transducing reversibly with finite state machines

This page was built for publication: Degrees of Reversibility for DFA and DPDA