The Degree of Irreversibility in Deterministic Finite Automata

DOI10.1142/S0129054117400044zbMath1380.68244OpenAlexW2772918710MaRDI QIDQ4605511

Markus Holzer, Martin Kutrib, Holger Bock Axelsen

Publication date: 22 February 2018

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054117400044

zbMATH Keywords

deterministic finite automatareversibilityhierarchydegree of irreversibilitylanguage operation problem

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

Quotients and atoms of reversible languages ⋮ Descriptive Complexity of Reversible Languages Having Finitely Many Reduced Automata ⋮ Descriptional complexity of regular languages

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