{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:00:50Z","timestamp":1725516050928},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540708438"},{"type":"electronic","value":"9783540708445"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-70844-5_2","type":"book-chapter","created":{"date-parts":[[2008,7,22]],"date-time":"2008-07-22T05:19:29Z","timestamp":1216703969000},"page":"17-22","source":"Crossref","is-referenced-by-count":1,"title":["Language Decompositions, Primality, and Trajectory-Based Operations"],"prefix":"10.1007","author":[{"given":"Kai","family":"Salomaa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"2_CR1","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1142\/S0218196796000246","volume":"6","author":"M. Anselmo","year":"1996","unstructured":"Anselmo, M., Restivo, A.: On languages factorizing the free monoid. Internat. J. Algebra and Computation\u00a06, 413\u2013427 (1996)","journal-title":"Internat. J. Algebra and Computation"},{"key":"2_CR2","doi-asserted-by":"publisher","first-page":"799","DOI":"10.1142\/S0129054102001461","volume":"13","author":"C. C\u00e2mpeanu","year":"2002","unstructured":"C\u00e2mpeanu, C., Salomaa, K., V\u00e1gv\u00f6lgyi, S.: Shuffle decompositions of regular languages. Internat. J. Foundations of Computer Science\u00a013, 799\u2013816 (2002)","journal-title":"Internat. J. Foundations of Computer Science"},{"key":"2_CR3","volume-title":"Regular Algebra and Finite Machines","author":"J.H. Conway","year":"1971","unstructured":"Conway, J.H.: Regular Algebra and Finite Machines. Chapman and Hall, Boca Raton (1971)"},{"key":"2_CR4","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":"2_CR5","unstructured":"Daley, M., Domaratzki, M., Salomaa, K.: On the operational orthogonality of languages. In: Kunc, M., Okhotin, A. (eds.) Proc. of Theory and Applications of Language Equations, Turku, Finland, pp. 43\u201353 (2007)"},{"key":"2_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/978-3-540-30550-7_14","volume-title":"Developments in Language Theory","author":"M. Domaratzki","year":"2004","unstructured":"Domaratzki, M.: Semantic shuffle and deletion along trajectories. In: Calude, C.S., Calude, E., Dinneen, M.J. (eds.) DLT 2004. LNCS, vol.\u00a03340, pp. 163\u2013174. Springer, Heidelberg (2004)"},{"key":"2_CR7","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/j.tcs.2004.02.031","volume":"320","author":"M. Domaratzki","year":"2004","unstructured":"Domaratzki, M.: Deletion along trajectories. Theoret. Comput. Sci.\u00a0320, 293\u2013313 (2004)","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR8","first-page":"182","volume":"73","author":"M. Domaratzki","year":"2006","unstructured":"Domaratzki, M., Rozenberg, G., Salomaa, K.: Interpreted trajectories. Fundamenta Informaticae\u00a073, 182\u2013193 (2006)","journal-title":"Fundamenta Informaticae"},{"key":"2_CR9","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":"2_CR10","doi-asserted-by":"publisher","first-page":"897","DOI":"10.1142\/S0129054105003364","volume":"16","author":"M. Domaratzki","year":"2005","unstructured":"Domaratzki, M., Salomaa, K.: Restricted sets of trajectories and decidability of shuffle decompositions. Internat. J. Foundations of Computer Science\u00a016, 897\u2013912 (2005)","journal-title":"Internat. J. Foundations of Computer Science"},{"key":"2_CR11","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/j.tcs.2007.01.013","volume":"376","author":"Y.-S. Han","year":"2007","unstructured":"Han, Y.-S., Salomaa, A., Salomaa, K., Wood, D., Yu, S.: On the existence of prime decompositions. Theoret. Comput. Sci.\u00a0376, 60\u201369 (2007)","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR12","first-page":"168","volume":"38","author":"F. Hinz","year":"1989","unstructured":"Hinz, F., Dassow, J.: An undecidability result for regular languages and its application to regulated rewriting. Bulletin of the EATCS\u00a038, 168\u2013174 (1989)","journal-title":"Bulletin of the EATCS"},{"key":"2_CR13","first-page":"257","volume":"8","author":"M. Ito","year":"2002","unstructured":"Ito, M.: Shuffle decomposition of regular languages. J. Universal Comput. Sci.\u00a08, 257\u2013259 (2002)","journal-title":"J. Universal Comput. Sci."},{"key":"2_CR14","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.tcs.2004.09.038","volume":"332","author":"L. Kari","year":"2005","unstructured":"Kari, L., Sos\u00edk, P.: Aspects of shuffle and deletion on trajectories. Theoret. Comput. Sci.\u00a0332, 47\u201361 (2005)","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(97)00163-1","volume":"197","author":"A. Mateescu","year":"1998","unstructured":"Mateescu, A., Rozenberg, G., Salomaa, A.: Shuffle on trajectories: Syntactic constraints. Theoret. Comput. Sci.\u00a0197, 1\u201356 (1998)","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR16","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":"2_CR17","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/0166-218X(94)00014-5","volume":"61","author":"G. P\u01ceun","year":"1995","unstructured":"P\u01ceun, G., Salomaa, A.: Thin and slender languages. Discr. Applied Math.\u00a061, 257\u2013270 (1995)","journal-title":"Discr. Applied Math."},{"key":"2_CR18","unstructured":"Rampersad, N., Ravikumar, B., Santean, N., Shallit, J.: A study on unique rational operations. Tech. report TR-20071222-1, Dept. of Computer and Information Sciences, Indiana University South Bend (2007)"},{"key":"2_CR19","unstructured":"Rampersad, N., Shallit, J.: Private communication (2006)"},{"key":"2_CR20","doi-asserted-by":"crossref","unstructured":"Salomaa, A., Salomaa, K., Yu, S.: Length codes, products of languages and primality. In: Fazekas, S., Martin-Vide, C., T\u00eern\u0103uc\u0103, C. (eds.) Proc. of the 2nd International Conference on Language and Automata Theory and Applications, LATA 2008, pp. 487\u2013498 (2008)","DOI":"10.1007\/978-3-540-88282-4_43"},{"key":"2_CR21","first-page":"22","volume-title":"Proc. Developments in Language Theory, DLT 1999","author":"A. Salomaa","year":"2000","unstructured":"Salomaa, A., Yu, S.: On the decomposition of finite languages. In: Proc. Developments in Language Theory, DLT 1999, pp. 22\u201331. World Scientific Publ. Co., Singapore (2000)"},{"key":"2_CR22","doi-asserted-by":"publisher","first-page":"1569","DOI":"10.1109\/18.532902","volume":"IT-42","author":"A. Weber","year":"1996","unstructured":"Weber, A., Head, T.: The finest homophonic partition and related code concepts. IEEE Trans. Inform. Theory\u00a0IT-42, 1569\u20131575 (1996)","journal-title":"IEEE Trans. Inform. Theory"}],"container-title":["Lecture Notes in Computer Science","Implementation and Applications of Automata"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70844-5_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T00:30:12Z","timestamp":1620001812000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70844-5_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540708438","9783540708445"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70844-5_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}