scientific article; zbMATH DE number 7444007
From MaRDI portal
Publication:5016365
zbMath1483.68174arXiv1708.06465MaRDI QIDQ5016365
Giovanni Pighizzini, Luca Prigioniero, Giovanna J. Lavado
Publication date: 13 December 2021
Full work available at URL: https://arxiv.org/abs/1708.06465
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (6)
Quotients and atoms of reversible languages ⋮ Descriptive Complexity of Reversible Languages Having Finitely Many Reduced Automata ⋮ Finite automata with undirected state graphs ⋮ Concise Representations of Reversible Automata ⋮ Transducing reversibly with finite state machines ⋮ Descriptional complexity of regular languages
Cites Work
- Unnamed Item
- Unnamed Item
- Space-bounded reducibility among combinatorial problems
- Reversible space equals deterministic space
- Concise representations of reversible automata
- Minimal and Reduced Reversible 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
- Inference of Reversible Languages
- Logical Reversibility of Computation
- Investigations on Automata and Languages Over a Unary Alphabet
This page was built for publication:
