{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,3]],"date-time":"2025-08-03T04:10:45Z","timestamp":1754194245405},"reference-count":10,"publisher":"World Scientific Pub Co Pte Lt","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2008,8]]},"abstract":"<jats:p> We give a canonical representation for minimal acyclic deterministic finite automata (MADFA) with n states over an alphabet of k symbols. Using this normal form, we present a method for the exact generation of MADFAs. This method avoids a rejection phase that would be needed if a generation algorithm for a larger class of objects that contains the MADFAs were used. We give upper and lower bounds for MADFAs enumeration and some exact formulas for small values of n. <\/jats:p>","DOI":"10.1142\/s0129054108005930","type":"journal-article","created":{"date-parts":[[2008,8,6]],"date-time":"2008-08-06T06:30:40Z","timestamp":1218004240000},"page":"751-765","source":"Crossref","is-referenced-by-count":8,"title":["EXACT GENERATION OF MINIMAL ACYCLIC DETERMINISTIC FINITE AUTOMATA"],"prefix":"10.1142","volume":"19","author":[{"given":"MARCO","family":"ALMEIDA","sequence":"first","affiliation":[{"name":"LIACC, Faculdade de Ci\u00eancias,  Universidade do Porto, Departamento de Ci\u00eancia de Computadores, Rua do Campo Alegre, 1021\/1055, 4169-007 Porto, Portugal"}]},{"given":"NELMA","family":"MOREIRA","sequence":"additional","affiliation":[{"name":"LIACC, Faculdade de Ci\u00eancias,  Universidade do Porto, Departamento de Ci\u00eancia de Computadores, Rua do Campo Alegre, 1021\/1055, 4169-007 Porto, Portugal"}]},{"given":"ROG\u00c9RIO","family":"REIS","sequence":"additional","affiliation":[{"name":"LIACC, Faculdade de Ci\u00eancias,  Universidade do Porto, Departamento de Ci\u00eancia de Computadores, Rua do Campo Alegre, 1021\/1055, 4169-007 Porto, Portugal"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2007.07.029"},{"key":"rf4","first-page":"189","volume":"9","author":"C\u00e2mpeanu C.","journal-title":"J. of Automata, Languages and Combinatorics"},{"key":"rf5","volume":"7","author":"Domaratzki M.","journal-title":"Journal of Integer Sequences"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054104002352"},{"key":"rf7","first-page":"469","volume":"7","author":"Domaratzki M.","journal-title":"J. of Automata, Languages and Combinatorics"},{"key":"rf8","volume-title":"Introduction to Automata Theory, Languages and Computation","author":"Hopcroft J.","year":"2000"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2005.06.009"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107341005"},{"key":"rf12","volume-title":"Analysis of Algorithms","author":"Sedgewick R.","year":"1996"},{"key":"rf14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-59136-5_2"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054108005930","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T11:23:34Z","timestamp":1565177014000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054108005930"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,8]]},"references-count":10,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2008,8]]}},"alternative-id":["10.1142\/S0129054108005930"],"URL":"https:\/\/doi.org\/10.1142\/s0129054108005930","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,8]]}}}