{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T01:07:46Z","timestamp":1767229666115,"version":"3.48.0"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030934880"},{"type":"electronic","value":"9783030934897"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-93489-7_10","type":"book-chapter","created":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:30:01Z","timestamp":1640997001000},"page":"113-124","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["State Complexity of Partial Word Finite Automata"],"prefix":"10.1007","author":[{"given":"Martin","family":"Kutrib","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthias","family":"Wendlandt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,1,1]]},"reference":[{"key":"10_CR1","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.tcs.2015.01.021","volume":"578","author":"E Balkanski","year":"2015","unstructured":"Balkanski, E., Blanchet-Sadri, F., Kilgore, M., Wyatt, B.J.: On the state complexity of partial word DFAs. Theor. Comput. Sci. 578, 2\u201312 (2015)","journal-title":"Theor. Comput. Sci."},{"key":"10_CR2","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/S0304-3975(98)00255-2","volume":"218","author":"J Berstel","year":"1999","unstructured":"Berstel, J., Boasson, L.: Partial words and a theorem of Fine and Wilf. Theor. Comput. Sci. 218, 135\u2013141 (1999)","journal-title":"Theor. Comput. Sci."},{"key":"10_CR3","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/0020-0190(92)90198-5","volume":"43","author":"JC Birget","year":"1992","unstructured":"Birget, J.C.: Intersection and union of regular languages and state complexity. Inform. Process. Lett. 43, 185\u2013190 (1992)","journal-title":"Inform. Process. Lett."},{"key":"10_CR4","volume-title":"Algorithmic Combinatorics on Partial Words","author":"F Blanchet-Sadri","year":"2008","unstructured":"Blanchet-Sadri, F.: Algorithmic Combinatorics on Partial Words. CRC Press, Boca Raton (2008)"},{"key":"10_CR5","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1051\/ita\/2017011","volume":"51","author":"F Blanchet-Sadri","year":"2017","unstructured":"Blanchet-Sadri, F., Goldner, K., Shackleton, A.: Minimal partial languages and automata. RAIRO Inform. Th\u00e9or. 51, 99\u2013119 (2017)","journal-title":"RAIRO Inform. Th\u00e9or."},{"key":"10_CR6","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1016\/j.ins.2013.12.032","volume":"268","author":"J Dassow","year":"2014","unstructured":"Dassow, J., Manea, F., Merca\u015f, R.: Regular languages of partial words. Inf. Sci. 268, 290\u2013304 (2014)","journal-title":"Inf. Sci."},{"key":"10_CR7","series-title":"SIAM-AMS Proceedings","first-page":"113","volume-title":"Complexity of Computation","author":"MJ Fischer","year":"1974","unstructured":"Fischer, M.J., Paterson, M.S.: String-matching and other products. In: Karp, R.M. (ed.) Complexity of Computation. SIAM-AMS Proceedings, vol. 7, pp. 113\u2013125. AMS, New Jersey (1974)"},{"key":"10_CR8","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/0020-0190(96)00095-6","volume":"59","author":"I Glaister","year":"1996","unstructured":"Glaister, I., Shallit, J.: A lower bound technique for the size of nondeterministic finite automata. Inform. Process. Lett. 59, 75\u201377 (1996)","journal-title":"Inform. Process. Lett."},{"key":"10_CR9","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/0890-5401(90)90053-K","volume":"86","author":"J Goldstine","year":"1990","unstructured":"Goldstine, J., Kintala, C.M.R., Wotschke, D.: On measuring nondeterminism in regular languages. Inform. Comput. 86, 179\u2013194 (1990)","journal-title":"Inform. Comput."},{"key":"10_CR10","first-page":"267","volume":"148","author":"M Holzer","year":"2016","unstructured":"Holzer, M., Jakobi, S., Wendlandt, M.: On the computational complexity of partial word automata problems. Fund. Inform. 148, 267\u2013289 (2016)","journal-title":"Fund. Inform."},{"key":"10_CR11","doi-asserted-by":"publisher","first-page":"1087","DOI":"10.1142\/S0129054103002199","volume":"14","author":"M Holzer","year":"2003","unstructured":"Holzer, M., Kutrib, M.: Nondeterministic descriptional complexity of regular languages. Int. J. Found. Comput. Sci. 14, 1087\u20131102 (2003)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"10_CR12","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1142\/S0129054109006747","volume":"20","author":"M Holzer","year":"2009","unstructured":"Holzer, M., Kutrib, M.: Nondeterministic finite automata - recent results on the descriptional and computational complexity. Int. J. Found. Comput. Sci. 20, 563\u2013580 (2009)","journal-title":"Int. J. Found. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Descriptional Complexity of Formal Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-93489-7_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T01:02:48Z","timestamp":1767229368000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-93489-7_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030934880","9783030934897"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-93489-7_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"1 January 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DCFS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Descriptional Complexity of Formal Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dcfs2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/toc.yonsei.ac.kr\/dcfs2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}