{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:37:47Z","timestamp":1725543467852},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540354284"},{"type":"electronic","value":"9783540354307"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11779148_14","type":"book-chapter","created":{"date-parts":[[2006,6,21]],"date-time":"2006-06-21T01:55:49Z","timestamp":1150854949000},"page":"145-155","source":"Crossref","is-referenced-by-count":2,"title":["Prime Decompositions of Regular Languages"],"prefix":"10.1007","author":[{"given":"Yo-Sub","family":"Han","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kai","family":"Salomaa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Derick","family":"Wood","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"14_CR1","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1142\/S0218196705002116","volume":"15","author":"S.V. Avgustinovich","year":"2005","unstructured":"Avgustinovich, S.V., Frid, A.E.: A unique decomposition theorem for factorial languages. Intern. J. of Algebra and Computation\u00a015, 149\u2013160 (2005)","journal-title":"Intern. J. of Algebra and Computation"},{"key":"14_CR2","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0304-3975(86)90142-8","volume":"47","author":"M. Chrobak","year":"1986","unstructured":"Chrobak, M.: Finite automata and unary languages. Theoret. Comput. Sci.\u00a047, 149\u2013158 (1986)","journal-title":"Theoret. Comput. Sci."},{"key":"14_CR3","doi-asserted-by":"publisher","first-page":"1019","DOI":"10.1142\/S0129054103002151","volume":"14","author":"J. Czyzowicz","year":"2003","unstructured":"Czyzowicz, J., Fraczak, W., Pelc, A., Rytter, W.: Linear-time prime decomposition of regular prefix codes. Internat. J. Foundations of Computer Science\u00a014, 1019\u20131031 (2003)","journal-title":"Internat. J. Foundations of Computer Science"},{"key":"14_CR4","doi-asserted-by":"publisher","first-page":"883","DOI":"10.1142\/S0129054105003352","volume":"16","author":"M. Domaratzki","year":"2005","unstructured":"Domaratzki, M., Ellul, K., Shallit, J., Wang, M.-W.: Non-uniqueness and radius of cyclic unary NFAs. Internat. J. Foundations of Computer Science\u00a016, 883\u2013896 (2005)","journal-title":"Internat. J. Foundations of Computer Science"},{"key":"14_CR5","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1016\/j.tcs.2005.07.013","volume":"345","author":"M. Domaratzki","year":"2005","unstructured":"Domaratzki, M., Salomaa, K.: Decidability of trajectory based equations. Theoret. Comput. Sci.\u00a0345, 304\u2013330 (2005)","journal-title":"Theoret. Comput. Sci."},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"Han, Y.-S., Wang, Y., Wood, D.: Infix-free regular expressions and languages. Internat. J. Foundations of Computer Science (to appear)","DOI":"10.1142\/S0129054106003887"},{"key":"14_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/978-3-540-30500-2_15","volume-title":"Implementation and Application of Automata","author":"Y.-S. Han","year":"2005","unstructured":"Han, Y.-S., Wood, D.: The generalization of generalized automata: Expression automata. In: Domaratzki, M., Okhotin, A., Salomaa, K., Yu, S. (eds.) CIAA 2004. LNCS, vol.\u00a03317, pp. 156\u2013166. Springer, Heidelberg (2005)"},{"key":"14_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/3-540-45005-X_14","volume-title":"Developments in Language Theory","author":"M. Holzer","year":"2003","unstructured":"Holzer, M., Kutrib, M.: Unary language operations and their nondeterministic state complexity. In: Ito, M., Toyama, M. (eds.) DLT 2002. LNCS, vol.\u00a02450, pp. 162\u2013172. Springer, Heidelberg (2003)"},{"key":"14_CR9","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"J.E. Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley Publishing Company, Reading (1979)"},{"key":"14_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/978-3-540-31834-7_3","volume-title":"Machines, Computations, and Universality","author":"J. Karhum\u00e4ki","year":"2005","unstructured":"Karhum\u00e4ki, J.: Finite sets of words and computing. In: Margenstern, M. (ed.) MCU 2004. LNCS, vol.\u00a03354, pp. 36\u201349. Springer, Heidelberg (2005)"},{"key":"14_CR11","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1006\/jcss.1996.0082","volume":"53","author":"L. Kari","year":"1996","unstructured":"Kari, L., Thierrin, G.: Maximal and minimal solutions to language equations. J. Comput. System Sci.\u00a053, 487\u2013496 (1996)","journal-title":"J. Comput. System Sci."},{"key":"14_CR12","first-page":"339","volume":"15","author":"A. Mateescu","year":"2002","unstructured":"Mateescu, A., Salomaa, A., Yu, S.: Factorizations of languages and commutativity conditions. Acta Cybernetica\u00a015, 339\u2013351 (2002)","journal-title":"Acta Cybernetica"},{"key":"14_CR13","unstructured":"Rampersad, N., Shallit, J.: Private communication"},{"key":"14_CR14","first-page":"22","volume-title":"Developments in Language Theory, DLT 1999","author":"A. Salomaa","year":"2000","unstructured":"Salomaa, A., Yu, S.: On the decomposition of finite languages. In: Rozenberg, G., Thomas, W. (eds.) Developments in Language Theory, DLT 1999, pp. 22\u201331. World Scientific, Singapore (2000)"},{"key":"14_CR15","unstructured":"Salomaa, A., Yu, S.: Private communication"},{"key":"14_CR16","volume-title":"Theory of Computation","author":"D. Wood","year":"1987","unstructured":"Wood, D.: Theory of Computation. John Wiley & Sons, New York (1987)"},{"key":"14_CR17","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/978-3-642-59136-5_2","volume-title":"Handbook of Formal Languages","author":"S. Yu","year":"1997","unstructured":"Yu, S.: Regular languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol.\u00a0I, pp. 41\u2013110. Springer, Heidelberg (1997)"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11779148_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:15:46Z","timestamp":1619493346000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11779148_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540354284","9783540354307"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11779148_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}