# Hyper-minimizing minimized deterministic finite state automata

Andrew Badr; Viliam Geffert; Ian Shipman

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (2009)

- Volume: 43, Issue: 1, page 69-94
- ISSN: 0988-3754

## Access Full Article

top## Abstract

top## How to cite

topBadr, Andrew, Geffert, Viliam, and Shipman, Ian. "Hyper-minimizing minimized deterministic finite state automata." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 43.1 (2009): 69-94. <http://eudml.org/doc/245126>.

@article{Badr2009,

abstract = {We present the first (polynomial-time) algorithm for reducing a given deterministic finite state automaton (DFA) into a hyper-minimized DFA, which may have fewer states than the classically minimized DFA. The price we pay is that the language recognized by the new machine can differ from the original on a finite number of inputs. These hyper-minimized automata are optimal, in the sense that every DFA with fewer states must disagree on infinitely many inputs. With small modifications, the construction works also for finite state transducers producing outputs. Within a class of finitely differing languages, the hyper-minimized automaton is not necessarily unique. There may exist several non-isomorphic machines using the minimum number of states, each accepting a separate language finitely-different from the original one. We will show that there are large structural similarities among all these smallest automata.},

author = {Badr, Andrew, Geffert, Viliam, Shipman, Ian},

journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},

keywords = {finite state automata; regular languages},

language = {eng},

number = {1},

pages = {69-94},

publisher = {EDP-Sciences},

title = {Hyper-minimizing minimized deterministic finite state automata},

url = {http://eudml.org/doc/245126},

volume = {43},

year = {2009},

}

TY - JOUR

AU - Badr, Andrew

AU - Geffert, Viliam

AU - Shipman, Ian

TI - Hyper-minimizing minimized deterministic finite state automata

JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

PY - 2009

PB - EDP-Sciences

VL - 43

IS - 1

SP - 69

EP - 94

AB - We present the first (polynomial-time) algorithm for reducing a given deterministic finite state automaton (DFA) into a hyper-minimized DFA, which may have fewer states than the classically minimized DFA. The price we pay is that the language recognized by the new machine can differ from the original on a finite number of inputs. These hyper-minimized automata are optimal, in the sense that every DFA with fewer states must disagree on infinitely many inputs. With small modifications, the construction works also for finite state transducers producing outputs. Within a class of finitely differing languages, the hyper-minimized automaton is not necessarily unique. There may exist several non-isomorphic machines using the minimum number of states, each accepting a separate language finitely-different from the original one. We will show that there are large structural similarities among all these smallest automata.

LA - eng

KW - finite state automata; regular languages

UR - http://eudml.org/doc/245126

ER -

## References

top- [1] A.V. Aho, J.E. Hopcroft and J.D. Ullman, The Design and Analysis of Computer Algorithms. Addison-Wesley (1976). Zbl0326.68005MR413592
- [2] A. Bertoni, C. Mereghetti and G. Pighizzini, An optimal lower bound for nonregular languages. Inform. Process. Lett. 50 (1994) 289–292. (Corrigendum: Inform. Process. Lett. 52 (1994) 339). Zbl0810.68089MR1286605
- [3] G. Brassard and P. Bratley, Fundamentals of Algorithmics. Prentice Hall (1996). Zbl0847.68046MR1345611
- [4] M. Chrobak, Finite automata and unary languages. Theoret. Comput. Sci. 47 (1986) 149–158. (Corrigendum: Theoret. Comput. Sci. 302 (2003) 497–498). Zbl0638.68096MR881208
- [5] V. Geffert, (Non)determinism and the size of one-way finite automata, in Proc. Descr. Compl. Formal Syst. IFIP & Univ. Milano (2005) 23–37.
- [6] V. Geffert, Magic numbers in the state hierarchy of finite automata, in Proc. Math. Found. Comput. Sci., Springer-Verlag. Lect. Notes Comput. Sci. 4162 (2006) 412–423. Zbl1132.68444MR2298196
- [7] V. Geffert, C. Mereghetti and G. Pighizzini, Converting two-way nondeterministic unary automata into simpler automata. Theoret. Comput. Sci. 295 (2003) 189–203. Zbl1045.68080MR1964665
- [8] J. Hopcroft, R. Motwani and J. Ullman, Introduction to Automata Theory, Languages and Computation. Addison-Wesley (2001). Zbl0980.68066MR645539
- [9] J.E. Hopcroft, An $nlogn$ algorithm for minimizing the states in a finite automaton, in The Theory of Machines and Computations, edited by Z. Kohave, pp. 189–196. Academic Press (1971). Zbl0293.94022
- [10] J.E. Hopcroft and J.D. Ullman, Introduction to Automata Theory, Languages and Computation. Addison-Wesley (1979). Zbl0426.68001MR645539
- [11] D.A. Huffman, The synthesis of sequential switching circuits. J. Franklin Inst. 257 (1954) 161–190 and 275–303. Zbl0166.27201MR62648
- [12] C. Mereghetti and G. Pighizzini, Optimal simulations between unary automata. SIAM J. Comput. 30 (2001) 1976–1992. Zbl0980.68048MR1856565
- [13] E.F. Moore, Gedanken experiments on sequential machines, in Automata Studies, edited by C.E. Shannon and J. McCarthy, pp. 129–153. Princeton University Press (1956). MR78059

## NotesEmbed ?

topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.