{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T16:32:53Z","timestamp":1774542773639,"version":"3.50.1"},"reference-count":6,"publisher":"World Scientific Pub Co Pte Ltd","issue":"05","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2005,10]]},"abstract":"<jats:p>As is well known, each minimal NFA for a regular language L is isomorphic to a subautomaton of the so-called universal automaton [Formula: see text] for L. We explore and compare various conditions on sets of states of [Formula: see text] which are related to the fact that induced subautomata of [Formula: see text] accept the whole language L. The methods of several previous works on minimalizations of NFA can be modified so that they fit in our approach. We also propose a new algorithm which is easy to implement.<\/jats:p>","DOI":"10.1142\/s0129054105003431","type":"journal-article","created":{"date-parts":[[2005,10,13]],"date-time":"2005-10-13T11:41:41Z","timestamp":1129203701000},"page":"999-1010","source":"Crossref","is-referenced-by-count":24,"title":["MINIMALIZATIONS OF NFA USING THE UNIVERSAL AUTOMATON"],"prefix":"10.1142","volume":"16","author":[{"given":"LIBOR","family":"POL\u00c1K","sequence":"first","affiliation":[{"name":"Department of Mathematics, Masaryk University, Jan\u00e1ckovo n\u00e1m. 2a, 662 95 Brno, Czech Republic"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf1","first-page":"166","volume":"47","author":"Arnold A.","journal-title":"Bull. EATCS"},{"key":"rf4","volume-title":"Regular Algebra and Finite Machines","author":"Conway J. H.","year":"1971"},{"key":"rf5","doi-asserted-by":"crossref","first-page":"339","DOI":"10.3233\/FUN-2002-51402","volume":"51","author":"Denis F.","journal-title":"Fundam. Inform."},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(05)80006-7"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1109\/T-C.1970.222994"},{"key":"rf11","volume-title":"\u00c9l\u00e9ments de th\u00e9orie des automates","author":"Sakarovitch J.","year":"2003"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054105003431","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,4]],"date-time":"2025-01-04T22:40:43Z","timestamp":1736030443000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054105003431"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,10]]},"references-count":6,"journal-issue":{"issue":"05","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2005,10]]}},"alternative-id":["10.1142\/S0129054105003431"],"URL":"https:\/\/doi.org\/10.1142\/s0129054105003431","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,10]]}}}