Minimal and Reduced Reversible Automata - Archive ouverte HAL Access content directly
Conference Papers Year : 2016

Minimal and Reduced Reversible Automata

(1) , (1) , (1)
1

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, it is proved that if the minimum deterministic automaton accepting a reversible language contains a loop in the “irreversible part” then it is always possible to construct infinitely many reduced reversible automata accepting such a language.
Fichier principal
Vignette du fichier
416473_1_En_13_Chapter.pdf (280.46 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01633945 , version 1 (13-11-2017)

Licence

Attribution - CC BY 4.0

Identifiers

Cite

Giovanna J. Lavado, Giovanni Pighizzini, Luca Prigioniero. Minimal and Reduced Reversible Automata. 18th International Workshop on Descriptional Complexity of Formal Systems (DCFS), Jul 2016, Bucharest, Romania. pp.168-179, ⟨10.1007/978-3-319-41114-9_13⟩. ⟨hal-01633945⟩
50 View
139 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More