Minimal Reversible Deterministic Finite Automata

DOI10.1007/978-3-319-21500-6_22zbMath1386.68091OpenAlexW2296048670MaRDI QIDQ3451109

Martin Kutrib, Sebastian Jakobi, Markus Holzer

Publication date: 10 November 2015

Published in: Developments in Language Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-21500-6_22

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (11)

The Degree of Irreversibility in Deterministic Finite Automata ⋮ Reversible Limited Automata ⋮ Reversible and Irreversible Computations of Deterministic Finite-State Devices ⋮ Descriptive Complexity of Reversible Languages Having Finitely Many Reduced Automata ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Concise Representations of Reversible Automata ⋮ Transducing reversibly with finite state machines ⋮ Minimal and Reduced Reversible Automata ⋮ The Degree of Irreversibility in Deterministic Finite Automata ⋮ Descriptional complexity of regular languages

This page was built for publication: Minimal Reversible Deterministic Finite Automata