Concise Representations of Reversible Automata
From MaRDI portal
Publication:5205047
DOI10.1142/S0129054119400331zbMath1427.68149OpenAlexW2974693702WikidataQ127226338 ScholiaQ127226338MaRDI QIDQ5205047
Giovanna J. Lavado, Luca Prigioniero
Publication date: 10 December 2019
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054119400331
Related Items (3)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Reversible space equals deterministic space
- Concise representations of reversible automata
- Aspects of Reversibility for Classical Automata
- Reversible and Irreversible Computations of Deterministic Finite-State Devices
- Degrees of Reversibility for DFA and DPDA
- Minimal Reversible Deterministic Finite Automata
- Irreversibility and Heat Generation in the Computing Process
- Logical Reversibility of Computation
This page was built for publication: Concise Representations of Reversible Automata