{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T13:46:29Z","timestamp":1772372789014,"version":"3.50.1"},"reference-count":26,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2015,10,1]],"date-time":"2015-10-01T00:00:00Z","timestamp":1443657600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T00:00:00Z","timestamp":1569888000000},"content-version":"vor","delay-in-days":1461,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100011929","name":"COMPETE","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100011929","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001871","name":"FCT","doi-asserted-by":"publisher","award":["PEst-C\/MAT\/UI0144\/2013"],"award-info":[{"award-number":["PEst-C\/MAT\/UI0144\/2013"]}],"id":[{"id":"10.13039\/501100001871","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001871","name":"FCT","doi-asserted-by":"publisher","award":["FCOMP-01-0124-FEDER-020486"],"award-info":[{"award-number":["FCOMP-01-0124-FEDER-020486"]}],"id":[{"id":"10.13039\/501100001871","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001871","name":"FCT","doi-asserted-by":"publisher","award":["SFRH\/BD\/78392\/2011"],"award-info":[{"award-number":["SFRH\/BD\/78392\/2011"]}],"id":[{"id":"10.13039\/501100001871","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information and Computation"],"published-print":{"date-parts":[[2015,10]]},"DOI":"10.1016\/j.ic.2015.08.004","type":"journal-article","created":{"date-parts":[[2015,8,20]],"date-time":"2015-08-20T02:30:13Z","timestamp":1440037813000},"page":"1-22","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":6,"special_numbering":"C","title":["Incomplete operational transition complexity of regular languages"],"prefix":"10.1016","volume":"244","author":[{"given":"Eva","family":"Maia","sequence":"first","affiliation":[]},{"given":"Nelma","family":"Moreira","sequence":"additional","affiliation":[]},{"given":"Rog\u00e9rio","family":"Reis","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/j.ic.2015.08.004_br0010","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/j.tcs.2007.07.029","article-title":"Enumeration and generation with a string automata representation","volume":"387","author":"Almeida","year":"2007","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.ic.2015.08.004_br0020","series-title":"Finite State Morphology","author":"Beesley","year":"2003"},{"issue":"35","key":"10.1016\/j.ic.2015.08.004_br0030","doi-asserted-by":"crossref","first-page":"3209","DOI":"10.1016\/j.tcs.2009.05.019","article-title":"Determination of finite automata accepting subregular languages","volume":"410","author":"Bordihn","year":"2009","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.ic.2015.08.004_br0040","series-title":"Proc. 4th LATA","first-page":"1","article-title":"Complexity in convex languages","volume":"vol. 6031","author":"Brzozowski","year":"2010"},{"key":"10.1016\/j.ic.2015.08.004_br0050","series-title":"Proc. 4th WIA","first-page":"60","article-title":"State complexity of basic operations on finite languages","volume":"vol. 2214","author":"C\u00e2mpeanu","year":"2001"},{"key":"10.1016\/j.ic.2015.08.004_br0060","series-title":"Introduction to Discrete Event Systems","author":"Cassandras","year":"2006"},{"issue":"2","key":"10.1016\/j.ic.2015.08.004_br0070","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/j.tcs.2007.07.034","article-title":"Transition complexity of language operations","volume":"387","author":"Domaratzki","year":"2007","journal-title":"Theor. Comput. Sci."},{"issue":"1\u20134","key":"10.1016\/j.ic.2015.08.004_br0080","doi-asserted-by":"crossref","first-page":"143","DOI":"10.3233\/FI-2011-533","article-title":"Transition complexity of incomplete DFAs","volume":"110","author":"Gao","year":"2011","journal-title":"Fundam. Inform."},{"issue":"3","key":"10.1016\/j.ic.2015.08.004_br0090","doi-asserted-by":"crossref","first-page":"581","DOI":"10.1142\/S0129054108005838","article-title":"State complexity of union and intersection of finite languages","volume":"19","author":"Han","year":"2008","journal-title":"Int. J. Found. Comput. Sci."},{"key":"10.1016\/j.ic.2015.08.004_br0100","series-title":"Proc. 7th CIAA","first-page":"148","article-title":"State complexity of basic operations on nondeterministic finite automata","volume":"vol. 2608","author":"Holzer","year":"2003"},{"key":"10.1016\/j.ic.2015.08.004_br0110","series-title":"Proc. 3rd LATA","first-page":"23","article-title":"Descriptional and computational complexity of finite automata","volume":"vol. 5457","author":"Holzer","year":"2009"},{"issue":"4","key":"10.1016\/j.ic.2015.08.004_br0120","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1142\/S0129054109006747","article-title":"Nondeterministic finite automata \u2013 recent results on the descriptional and computational complexity","volume":"20","author":"Holzer","year":"2009","journal-title":"Int. J. Found. Comput. Sci."},{"key":"10.1016\/j.ic.2015.08.004_br0130","series-title":"Introduction to Automata Theory, Languages and Computation","author":"Hopcroft","year":"1979"},{"issue":"2","key":"10.1016\/j.ic.2015.08.004_br0140","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/j.tcs.2004.04.011","article-title":"State complexity of some operations on binary regular languages","volume":"330","author":"Jir\u00e1skov\u00e1","year":"2005","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.ic.2015.08.004_br0150","series-title":"Proc. 18th CIAA","first-page":"349","article-title":"Incomplete transition complexity of basic operations on finite languages","volume":"vol. 7982","author":"Maia","year":"2013"},{"key":"10.1016\/j.ic.2015.08.004_br0160","series-title":"Proc. 39th SOFSEM","first-page":"319","article-title":"Incomplete transition complexity of some basic operations","volume":"vol. 7741","author":"Maia","year":"2013"},{"key":"10.1016\/j.ic.2015.08.004_br0170","series-title":"Automata and Dictionaries","author":"Maurel","year":"2005"},{"issue":"2","key":"10.1016\/j.ic.2015.08.004_br0180","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1017\/S0956796808007090","article-title":"Regular-expression derivatives re-examined","volume":"19","author":"Owens","year":"2009","journal-title":"J. Funct. Program."},{"key":"10.1016\/j.ic.2015.08.004_br0190","series-title":"Proc. 11th DLT","first-page":"31","article-title":"Descriptional complexity of nondeterministic finite automata","volume":"vol. 4588","author":"Salomaa","year":"2007"},{"issue":"3","key":"10.1016\/j.ic.2015.08.004_br0200","first-page":"177","article-title":"NFA to DFA transformation for finite languages over arbitrary alphabets","volume":"2","author":"Salomaa","year":"1997","journal-title":"J. Autom. Lang. Comb."},{"key":"10.1016\/j.ic.2015.08.004_br0210","series-title":"A Second Course in Formal Languages and Automata Theory","author":"Shallit","year":"2008"},{"key":"10.1016\/j.ic.2015.08.004_br0220","series-title":"Handbook of Formal Languages, vol. 1","first-page":"41","article-title":"Regular languages","author":"Yu","year":"1997"},{"issue":"1\u20134","key":"10.1016\/j.ic.2015.08.004_br0230","first-page":"471","article-title":"State complexity: recent results and open problems","volume":"64","author":"Yu","year":"2005","journal-title":"Fundam. Inform."},{"key":"10.1016\/j.ic.2015.08.004_br0240","series-title":"Proc. 11th CIAA","first-page":"11","article-title":"On the state complexity of combined operations","volume":"vol. 4094","author":"Yu","year":"2006"},{"key":"10.1016\/j.ic.2015.08.004_br0250","series-title":"Proc. 15th DLT","first-page":"46","article-title":"State complexity research and approximation","volume":"vol. 6795","author":"Yu","year":"2011"},{"issue":"2","key":"10.1016\/j.ic.2015.08.004_br0260","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/0304-3975(92)00011-F","article-title":"The state complexities of some basic operations on regular languages","volume":"125","author":"Yu","year":"1994","journal-title":"Theor. Comput. Sci."}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0890540115000863?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0890540115000863?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,9,7]],"date-time":"2020-09-07T10:22:16Z","timestamp":1599474136000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0890540115000863"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,10]]},"references-count":26,"alternative-id":["S0890540115000863"],"URL":"https:\/\/doi.org\/10.1016\/j.ic.2015.08.004","relation":{},"ISSN":["0890-5401"],"issn-type":[{"value":"0890-5401","type":"print"}],"subject":[],"published":{"date-parts":[[2015,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Incomplete operational transition complexity of regular languages","name":"articletitle","label":"Article Title"},{"value":"Information and Computation","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ic.2015.08.004","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2015 Elsevier Inc. All rights reserved.","name":"copyright","label":"Copyright"}]}}