The Degree of Irreversibility in Deterministic Finite Automata

DOI10.1007/978-3-319-40946-7_2zbMath1379.68210OpenAlexW2488819432MaRDI QIDQ2830203

Holger Bock Axelsen, Martin Kutrib, Markus Holzer

Publication date: 9 November 2016

Published in: Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-40946-7_2

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

Descriptive Complexity of Reversible Languages Having Finitely Many Reduced Automata

Cites Work

• Unnamed Item
• Reversible computing and cellular automata -- a survey
• The state complexities of some basic operations on regular languages
• Towards a Domain-Specific Language for Reversible Assembly Sequences
• Aspects of Reversibility for Classical Automata
• Boosting Reversible Pushdown Machines by Preprocessing
• THE ABSTRACT THEORY OF AUTOMATA
• Minimal Reversible Deterministic Finite Automata
• Irreversibility and Heat Generation in the Computing Process

This page was built for publication: The Degree of Irreversibility in Deterministic Finite Automata