{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T14:35:26Z","timestamp":1648650926102},"reference-count":19,"publisher":"World Scientific Pub Co Pte Lt","issue":"03","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2008,6]]},"abstract":"<jats:p> We show that for all integers n and \u03b1 such that n \u2a7d \u03b1 \u2a7d 2<jats:sup>n<\/jats:sup>, there exists a minimal nondeterministic finite automaton of n states with a four-letter input alphabet whose equivalent minimal deterministic finite automaton has exactly \u03b1 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. <\/jats:p>","DOI":"10.1142\/s0129054108005851","type":"journal-article","created":{"date-parts":[[2008,6,3]],"date-time":"2008-06-03T10:27:20Z","timestamp":1212488840000},"page":"617-631","source":"Crossref","is-referenced-by-count":6,"title":["DETERMINISTIC BLOW-UPS OF MINIMAL NONDETERMINISTIC FINITE AUTOMATA OVER A FIXED ALPHABET"],"prefix":"10.1142","volume":"19","author":[{"given":"JOZEF","family":"JIR\u00c1SEK","sequence":"first","affiliation":[{"name":"Institute of Computer Science, P. J. \u0160af\u00e1rik University, Jesenn\u00e1 5, 041 54 Ko\u0161ice, Slovakia"}]},{"given":"GALINA","family":"JIR\u00c1SKOV\u00c1","sequence":"additional","affiliation":[{"name":"Mathematical Institute, Slovak Academy of Sciences, Gre\u0161\u00e1kova 6, 040 01 Ko\u0161ice, Slovakia"}]},{"given":"ALEXANDER","family":"SZABARI","sequence":"additional","affiliation":[{"name":"Institute of Computer Science, P. J. \u0160af\u00e1rik University, Jesenn\u00e1 5, 041 54 Ko\u0161ice, Slovakia"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf1","first-page":"419","volume":"7","author":"Adorna H. N.","journal-title":"J. Autom. Lang. Comb."},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(92)90198-5"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(93)90160-U"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(86)90142-8"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(03)00136-1"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(96)00095-6"},{"key":"rf11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-03442-2"},{"key":"rf12","first-page":"519","volume":"7","author":"Hromkovi\u010d J.","journal-title":"J. Autom. Lang. Comb."},{"key":"rf13","doi-asserted-by":"publisher","DOI":"10.1006\/inco.2001.3069"},{"key":"rf14","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(00)00029-3"},{"key":"rf15","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(02)00891-5"},{"key":"rf17","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2004.04.011"},{"key":"rf18","first-page":"321","volume":"9","author":"Lupanov O. B.","journal-title":"Problemy Kibernetiki"},{"key":"rf19","first-page":"337","volume":"5","author":"Lyubich Yu. I.","journal-title":"Sibirskii Matematichskii Zhurnal"},{"key":"rf20","first-page":"1211","volume":"20","author":"Moore F. R.","journal-title":"IEEE Trans. Comput."},{"key":"rf21","doi-asserted-by":"publisher","DOI":"10.1147\/rd.32.0114"},{"key":"rf23","volume-title":"Introduction to the theory of computation","author":"Sipser M.","year":"1997"},{"key":"rf24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-59136-5_2"},{"key":"rf25","first-page":"270","volume":"72","author":"Yu S.","journal-title":"Bull. Eur. Assoc. Theoret. Comput. Set."}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054108005851","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T00:33:27Z","timestamp":1565138007000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054108005851"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,6]]},"references-count":19,"journal-issue":{"issue":"03","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2008,6]]}},"alternative-id":["10.1142\/S0129054108005851"],"URL":"https:\/\/doi.org\/10.1142\/s0129054108005851","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,6]]}}}