Weakly and Strongly Irreversible Regular Languages
From MaRDI portal
Publication:6114869
DOI10.1142/s0129054122410052OpenAlexW4226030076MaRDI QIDQ6114869
Giovanni Pighizzini, Bruno Guillon, Giovanna J. Lavado, Luca Prigioniero
Publication date: 15 August 2023
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054122410052
forbidden patterndecision algorithmreversible automaton\(k\)-reversible automatonstrongly irreversible regular languages
Cites Work
- Unnamed Item
- Unnamed Item
- Space-bounded reducibility among combinatorial problems
- Reversible space equals deterministic space
- Automata, languages and programming. 29th international colloquium, ICALP 2002, Málaga, Spain, July 8--13, 2002. Proceedings
- Reversible and Irreversible Computations of Deterministic Finite-State Devices
- Degrees of Reversibility for DFA and DPDA
- Irreversibility and Heat Generation in the Computing Process
- Inference of Reversible Languages
- Minimal Reversible Deterministic Finite Automata
- Concise Representations of Reversible Automata
- Logical Reversibility of Computation
- Investigations on Automata and Languages Over a Unary Alphabet
This page was built for publication: Weakly and Strongly Irreversible Regular Languages
