{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T14:31:56Z","timestamp":1742999516049,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319214993"},{"type":"electronic","value":"9783319215006"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-21500-6_7","type":"book-chapter","created":{"date-parts":[[2015,7,17]],"date-time":"2015-07-17T08:07:44Z","timestamp":1437120464000},"page":"97-107","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Factorization in Formal Languages"],"prefix":"10.1007","author":[{"given":"Paul C.","family":"Bell","sequence":"first","affiliation":[]},{"given":"Daniel","family":"Reidenbach","sequence":"additional","affiliation":[]},{"given":"Jeffrey","family":"Shallit","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,7,18]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Berstel, J., Perrin, D., Reutenauer, C.: Codes and automata. In: Encyclopedia of Mathematics and its Applications, vol. 129. Cambridge University Press (2010)","DOI":"10.1017\/CBO9781139195768"},{"key":"7_CR2","doi-asserted-by":"publisher","first-page":"1257","DOI":"10.1016\/S0898-1221(01)00096-7","volume":"41","author":"F Blanchet-Sadri","year":"2001","unstructured":"Blanchet-Sadri, F., Morgan, C.: Multiset and set decipherable codes. Computers and Mathematics with Applications 41, 1257\u20131262 (2001)","journal-title":"Computers and Mathematics with Applications"},{"key":"7_CR3","first-page":"227","volume":"9","author":"F Burderi","year":"2007","unstructured":"Burderi, F., Restivo, A.: Coding partitions. Discrete Mathematics and Theoretical Computer Science 9, 227\u2013240 (2007)","journal-title":"Discrete Mathematics and Theoretical Computer Science"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Head, T., Weber, A.: Deciding code related properties by means of finite transducers. In: Capocelli, R., De Santis, A., Vaccaro, U. (Eds.) Sequences II: Methods in Communication, Security, and Computer Science, pp. 260\u2013272. Springer (1993)","DOI":"10.1007\/978-1-4613-9323-8_19"},{"key":"7_CR5","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1109\/18.370097","volume":"41","author":"T Head","year":"1995","unstructured":"Head, T., Weber, A.: Deciding multiset decipherability. IEEE Trans. Info. Theory 41, 291\u2013297 (1995)","journal-title":"IEEE Trans. Info. Theory"},{"key":"7_CR6","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley (1979)"},{"key":"7_CR7","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1137\/0217058","volume":"17","author":"N Immerman","year":"1988","unstructured":"Immerman, N.: Nondeterministic space is closed under complementation. SIAM J. Comput. 17, 935\u2013938 (1988)","journal-title":"SIAM J. Comput."},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"J\u00fcrgensen, H., Konstantinidis, S.: Codes. In: Rozenberg, G., Salomaa, A. (Eds.) Handbook of Formal Languages, Word, Language, Grammar, vol. 1, pp. 511\u2013607. Springer (1991)","DOI":"10.1007\/978-3-642-59136-5_8"},{"key":"7_CR9","doi-asserted-by":"publisher","first-page":"714","DOI":"10.1109\/TIT.1986.1057217","volume":"32","author":"A Lempel","year":"1986","unstructured":"Lempel, A.: On multiset decipherable codes. IEEE Trans. Info. Theory 32, 714\u2013716 (1986)","journal-title":"IEEE Trans. Info. Theory"},{"key":"7_CR10","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1016\/j.ipl.2011.01.018","volume":"111","author":"N Rampersad","year":"2011","unstructured":"Rampersad, N., Shallit, J., Wang, M.-W.: Inverse star, borders, and palstars. Info. Proc. Letters 111, 420\u2013422 (2011)","journal-title":"Info. Proc. Letters"},{"key":"7_CR11","doi-asserted-by":"publisher","first-page":"662","DOI":"10.1109\/18.30991","volume":"35","author":"A Restivo","year":"1989","unstructured":"Restivo, A.: A note on multiset decipherable codes. IEEE Trans. Info. Theory 35, 662\u2013663 (1989)","journal-title":"IEEE Trans. Info. Theory"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Shallit, J.: A Second Course in Formal Languages and Automata Theory. Cambridge University Press (2009)","DOI":"10.1017\/CBO9780511808876"},{"key":"7_CR13","first-page":"96","volume":"33","author":"R Szelepcs\u00e9nyi","year":"1987","unstructured":"Szelepcs\u00e9nyi, R.: The method of forcing for nondeterministic automata. Bull. EATCS 33, 96\u2013100 (1987)","journal-title":"Bull. EATCS"},{"key":"7_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"618","DOI":"10.1007\/3-540-58338-6_108","volume-title":"Mathematical Foundations of Computer Science 1994","author":"A Weber","year":"1994","unstructured":"Weber, A., Head, T.: The finest homophonic partition and related code concepts. In: Privara, I., Ru\u017ei\u010dka, P., Rovan, B. (eds.) MFCS 1994. LNCS, vol. 841, pp. 618\u2013628. Springer, Heidelberg (1994)"},{"key":"7_CR15","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1006\/inco.1998.2787","volume":"152","author":"G-Q Zhang","year":"1999","unstructured":"Zhang, G.-Q.: Automata, Boolean matrices, and ultimate periodicity. Inf. Comput. 152, 138\u2013154 (1999)","journal-title":"Inf. Comput."}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-21500-6_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,28]],"date-time":"2023-01-28T12:14:59Z","timestamp":1674908099000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-21500-6_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319214993","9783319215006"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21500-6_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"18 July 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}