DETERMINISTIC BLOW-UPS OF MINIMAL NONDETERMINISTIC FINITE AUTOMATA OVER A FIXED ALPHABET
2008 ◽
Vol 19
(03)
◽
pp. 617-631
◽
Keyword(s):
We show that for all integers n and α such that n ⩽ α ⩽ 2n, there exists a minimal nondeterministic finite automaton of n states with a four-letter input alphabet whose equivalent minimal deterministic finite automaton has exactly α states. It follows that in the case of a four-letter alphabet, there are no "magic numbers", i.e., the holes in the hierarchy. This improves a similar result obtained by Geffert for a growing alphabet of size n + 2.
2005 ◽
Vol 16
(05)
◽
pp. 1027-1038
◽
2011 ◽
Vol 22
(02)
◽
pp. 331-344
◽
2017 ◽
Vol 28
(05)
◽
pp. 503-522
2018 ◽
Vol 29
(05)
◽
pp. 861-876
◽
2009 ◽
Vol 02
(04)
◽
pp. 717-726
2012 ◽
Vol 23
(01)
◽
pp. 115-131
◽
2014 ◽
Vol 25
(07)
◽
pp. 877-896
◽