{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T01:08:52Z","timestamp":1767229732469,"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_7","type":"book-chapter","created":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:30:01Z","timestamp":1640997001000},"page":"76-87","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["More on\u00a0the\u00a0Descriptional Complexity of\u00a0Products of\u00a0Finite Automata"],"prefix":"10.1007","author":[{"given":"Markus","family":"Holzer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Rauch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,1,1]]},"reference":[{"issue":"2","key":"7_CR1","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/S0022-0000(77)80016-0","volume":"14","author":"T Ae","year":"1977","unstructured":"Ae, T.: Direct or cascade product of pushdown automata. J. Comput. Syst. Sci. 14(2), 257\u2013263 (1977)","journal-title":"J. Comput. Syst. Sci."},{"key":"7_CR2","unstructured":"Arbib, M.A.: Algebraic Theory of Machines, Languages, and Semigroups. Academic Press, New York (1968)"},{"key":"7_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1007\/978-3-642-22600-7_16","volume-title":"Descriptional Complexity of Formal Systems","author":"G Jir\u00e1skov\u00e1","year":"2011","unstructured":"Jir\u00e1skov\u00e1, G., Masopust, T.: State complexity of projected languages. In: Holzer, M., Kutrib, M., Pighizzini, G. (eds.) DCFS 2011. LNCS, vol. 6808, pp. 198\u2013211. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22600-7_16"},{"key":"7_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1007\/978-3-319-08846-4_10","volume-title":"Implementation and Application of Automata","author":"K \u010cevorov\u00e1","year":"2014","unstructured":"\u010cevorov\u00e1, K., Jir\u00e1skov\u00e1, G., Kraj\u0148\u00e1kov\u00e1, I.: On the square of regular languages. In: Holzer, M., Kutrib, M. (eds.) CIAA 2014. LNCS, vol. 8587, pp. 136\u2013147. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-08846-4_10"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"D\u00f6m\u00f6si, P., Nehaniv, C.L.: Algebraic Theory of Automata Networks: An Introduction. SIAM, Philadelphia (2005)","DOI":"10.1137\/1.9780898718492"},{"key":"7_CR6","unstructured":"Harrison, M.A.: Introduction to Formal Language Theory. Addison-Wesley, Boston (1978)"},{"key":"7_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/978-3-030-81508-0_19","volume-title":"Developments in Language Theory","author":"M Holzer","year":"2021","unstructured":"Holzer, M., Rauch, C.: The range of state complexities of languages resulting from the cascade product\u2014the general case (extended abstract). In: Moreira, N., Reis, R. (eds.) DLT 2021. LNCS, vol. 12811, pp. 229\u2013241. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-81508-0_19"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Holzer, M., Rauch, C.: The range of state complexities of languages resulting from the cascade product\u2013the unary case. In: Maneth, S. (ed.) Proceedings of the CIAA, pp. 90\u2013101, LNCS, Springer, Bremen (2021)","DOI":"10.1007\/978-3-030-79121-6_8"},{"key":"7_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/978-3-030-13435-8_14","volume-title":"Language and Automata Theory and Applications","author":"M Holzer","year":"2019","unstructured":"Holzer, M., Hospod\u00e1r, M.: The range of state complexities of languages resulting from the cut operation. In: Mart\u00edn-Vide, C., Okhotin, A., Shapira, D. (eds.) LATA 2019. LNCS, vol. 11417, pp. 190\u2013202. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-13435-8_14"},{"key":"7_CR10","unstructured":"Hricko, M., Jir\u00e1skov\u00e1, G., Szabari, A.: Union and intersection of regular languages and descriptional complexity. In: Mereghetti, C., Palano, B., Pighizzini, G., Wotschke, D. (eds.) Proceedings of the DCFS, pp. 170\u2013181. Universita degli Studi di Milano, Como (2005)"},{"issue":"1\u20132","key":"7_CR11","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1016\/S0304-3975(00)00029-3","volume":"237","author":"K Iwama","year":"2000","unstructured":"Iwama, K., Kambayashi, Y., Takaki, K.: Tight bounds on the number of states of DFAs that are equivalent to $$n$$-state NFAs. Theoret. Comput. Sci. 237(1\u20132), 485\u2013494 (2000)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"7_CR12","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1142\/S0129054111008076","volume":"22","author":"G Jir\u00e1skov\u00e1","year":"2011","unstructured":"Jir\u00e1skov\u00e1, G.: Magic numbers and ternary alphabet. Internat. J. Found. Comput. Sci. 22(2), 331\u2013344 (2011)","journal-title":"Internat. 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_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T01:04:17Z","timestamp":1767229457000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-93489-7_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030934880","9783030934897"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-93489-7_7","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"}]}}