Minimal and Reduced Reversible Automata

DOI10.1007/978-3-319-41114-9_13zbMath1476.68133arXiv1611.06840OpenAlexW2478542454MaRDI QIDQ2829980

Giovanna J. Lavado, Luca Prigioniero, Giovanni Pighizzini

Publication date: 9 November 2016

Published in: Descriptional Complexity of Formal Systems (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1611.06840

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

Descriptive Complexity of Reversible Languages Having Finitely Many Reduced Automata ⋮ Unnamed Item ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Reversible space equals deterministic space
• Aspects of Reversibility for Classical Automata
• Reversible and Irreversible Computations of Deterministic Finite-State Devices
• Minimal Reversible Deterministic Finite Automata
• Irreversibility and Heat Generation in the Computing Process
• Inference of Reversible Languages
• Logical Reversibility of Computation

This page was built for publication: Minimal and Reduced Reversible Automata