{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T20:19:27Z","timestamp":1725740367987},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642392733"},{"type":"electronic","value":"9783642392740"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39274-0_31","type":"book-chapter","created":{"date-parts":[[2013,7,11]],"date-time":"2013-07-11T01:07:42Z","timestamp":1373504862000},"page":"349-356","source":"Crossref","is-referenced-by-count":1,"title":["Incomplete Transition Complexity of Basic Operations on Finite Languages"],"prefix":"10.1007","author":[{"given":"Eva","family":"Maia","sequence":"first","affiliation":[]},{"given":"Nelma","family":"Moreira","sequence":"additional","affiliation":[]},{"given":"Rog\u00e9rio","family":"Reis","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"31_CR1","volume-title":"Finite State Morphology","author":"K.R. Beesley","year":"2003","unstructured":"Beesley, K.R., Karttunen, L.: Finite State Morphology. CSLI Publications, Stanford University (2003)"},{"key":"31_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/3-540-45526-4_6","volume-title":"Automata Implementation","author":"C. C\u00e2mpeanu","year":"2001","unstructured":"C\u00e2mpeanu, C., Culik, K., Salomaa, K., Yu, S.: State complexity of basic operations on finite languages. In: Boldt, O., J\u00fcrgensen, H. (eds.) WIA 1999. LNCS, vol.\u00a02214, pp. 60\u201370. Springer, Heidelberg (2001)"},{"key":"31_CR3","unstructured":"Cassandras, C.G., Lafortune, S.: Introduction to discrete event systems. Springer (2006)"},{"issue":"1-4","key":"31_CR4","doi-asserted-by":"crossref","first-page":"143","DOI":"10.3233\/FI-2011-533","volume":"110","author":"Y. Gao","year":"2011","unstructured":"Gao, Y., Salomaa, K., Yu, S.: Transition complexity of incomplete DFAs. Fundam. Inform.\u00a0110(1-4), 143\u2013158 (2011)","journal-title":"Fundam. Inform."},{"issue":"3","key":"31_CR5","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1142\/S0129054108005838","volume":"19","author":"Y.S. Han","year":"2008","unstructured":"Han, Y.S., Salomaa, K.: State complexity of union and intersection of finite languages. Int. J. Found. Comput. Sci.\u00a019(3), 581\u2013595 (2008)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"31_CR6","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley (1979)"},{"key":"31_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/978-3-642-35843-2_28","volume-title":"SOFSEM 2013: Theory and Practice of Computer Science","author":"E. Maia","year":"2013","unstructured":"Maia, E., Moreira, N., Reis, R.: Incomplete transition complexity of some basic operations. In: van Emde Boas, P., Groen, F.C.A., Italiano, G.F., Nawrocki, J., Sack, H. (eds.) SOFSEM 2013. LNCS, vol.\u00a07741, pp. 319\u2013331. Springer, Heidelberg (2013)"},{"key":"31_CR8","unstructured":"Maurel, D., Guenthner, F.: Automata and Dictionaries. College Publications (2005)"},{"issue":"2","key":"31_CR9","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1017\/S0956796808007090","volume":"19","author":"S. Owens","year":"2009","unstructured":"Owens, S., Reppy, J.H., Turon, A.: Regular-expression derivatives re-examined. J. Funct. Program.\u00a019(2), 173\u2013190 (2009)","journal-title":"J. Funct. Program."},{"issue":"3","key":"31_CR10","first-page":"177","volume":"2","author":"K. Salomaa","year":"1997","unstructured":"Salomaa, K., Yu, S.: NFA to DFA transformation for finite languages over arbitrary alphabets. J. of Aut., Lang. and Comb.\u00a02(3), 177\u2013186 (1997)","journal-title":"J. of Aut., Lang. and Comb."},{"key":"31_CR11","doi-asserted-by":"crossref","unstructured":"Shallit, J.: A Second Course in Formal Languages and Automata Theory. CUP (2008)","DOI":"10.1017\/CBO9780511808876"},{"key":"31_CR12","doi-asserted-by":"crossref","unstructured":"Yu, S.: Regular languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol.\u00a01, pp. 41\u2013110. Springer (1997)","DOI":"10.1007\/978-3-642-59136-5_2"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-39274-0_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,30]],"date-time":"2020-07-30T10:59:50Z","timestamp":1596106790000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-39274-0_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642392733","9783642392740"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39274-0_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}