Concise representations of reversible automata
From MaRDI portal
Publication:5205047
DOI10.1142/S0129054119400331zbMATH Open1427.68149OpenAlexW2974693702WikidataQ127226338 ScholiaQ127226338MaRDI QIDQ5205047FDOQ5205047
Authors: 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
Recommendations
Cites Work
- Introduction to algorithms.
- Title not available (Why is that?)
- Irreversibility and Heat Generation in the Computing Process
- Logical Reversibility of Computation
- Title not available (Why is that?)
- Reversible and irreversible computations of deterministic finite-state devices
- Minimal reversible deterministic finite automata
- Minimal and reduced reversible automata
- Aspects of reversibility for classical automata
- Degrees of reversibility for DFA and DPDA
- Reversible space equals deterministic space
- Concise representations of reversible automata
- Title not available (Why is that?)
- Reversible languages having finitely many reduced automata
Cited In (10)
- Reactive automata
- When input-driven pushdown automata meet reversiblity
- On a compact encoding of the swap automaton
- Title not available (Why is that?)
- Minimal and Reduced Reversible Automata
- A lower bound for reversible automata
- Weakly and Strongly Irreversible Regular Languages
- Reversible computations of one-way counter automata
- Reversible pushdown transducers
- Concise representations of reversible automata
This page was built for publication: Concise representations of reversible automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5205047)
