Abstract: A condition characterizing the class of regular languages which have several nonisomorphic minimal reversible automata is presented. The condition concerns the structure of the minimum automaton accepting the language under consideration. It is also observed that there exist reduced reversible automata which are not minimal, in the sense that all the automata obtained by merging some of their equivalent states are irreversible. Furthermore, a sufficient condition for the existence of infinitely many reduced reversible automata accepting a same language is given. It is also proved that, when the language is accepted by a unique minimal reversible automaton (that does not necessarily coincide with the minimum deterministic automaton), then no other reduced reversible automata accepting it can exist.
Recommendations
- Minimal and reduced reversible automata
- Minimal reversible deterministic finite automata
- Minimal reversible deterministic finite automata
- Concise representations of reversible automata
- Concise representations of reversible automata
- Reversible limited automata
- Reversible limited automata
- Minimisation of automata
- Reversible languages having finitely many reduced automata
- A lower bound for reversible automata
Cites work
- Aspects of reversibility for classical automata
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- Inference of Reversible Languages
- Irreversibility and Heat Generation in the Computing Process
- Logical Reversibility of Computation
- Minimal reversible deterministic finite automata
- Reversible and irreversible computations of deterministic finite-state devices
- Reversible space equals deterministic space
Cited in
(18)- On locally reversible languages
- A lower bound for reversible automata
- scientific article; zbMATH DE number 3864507 (Why is no real title available?)
- A small minimal aperiodic reversible Turing machine
- Minimal reversible deterministic finite automata
- On the k-reversibility of finite automata
- scientific article; zbMATH DE number 3903976 (Why is no real title available?)
- scientific article; zbMATH DE number 4020506 (Why is no real title available?)
- scientific article; zbMATH DE number 1962780 (Why is no real title available?)
- Minimal and reduced reversible automata
- Minimal reversible deterministic finite automata
- scientific article; zbMATH DE number 1870550 (Why is no real title available?)
- Reversible languages having finitely many reduced automata
- scientific article; zbMATH DE number 7444007 (Why is no real title available?)
- Descriptive Complexity of Reversible Languages Having Finitely Many Reduced Automata
- Weakly and Strongly Irreversible Regular Languages
- Bideterministic automata and minimal representations of regular languages
- Primitive and irreducible automata
This page was built for publication: Minimal and Reduced Reversible Automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2829980)
