{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,25]],"date-time":"2025-07-25T10:43:37Z","timestamp":1753440217123},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540207818"},{"type":"electronic","value":"9783540246350"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-24635-0_20","type":"book-chapter","created":{"date-parts":[[2010,8,2]],"date-time":"2010-08-02T15:11:15Z","timestamp":1280761875000},"page":"278-288","source":"Crossref","is-referenced-by-count":4,"title":["On Languages of Cyclic Words"],"prefix":"10.1007","author":[{"given":"Manfred","family":"Kudlek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"20_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/3-540-44992-2_9","volume-title":"DNA Computing","author":"P. Bonizzoni","year":"2001","unstructured":"Bonizzoni, P., de Felice, C., Mauri, G., Zizza, R.: DNA and Circular Splicing. In: Condon, A., Rozenberg, G. (eds.) DNA 2000. LNCS, vol.\u00a02054, pp. 117\u2013129. Springer, Heidelberg (2001)"},{"key":"20_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/3-540-45005-X_7","volume-title":"Developments in Language Theory","author":"P. Bonizzoni","year":"2003","unstructured":"Bonizzoni, P., de Felice, C., Mauri, G., Zizza, R.: Decision Problems for Linear and Circular Splicing Systems. In: Ito, M., Toyama, M. (eds.) DLT 2002. LNCS, vol.\u00a02450, pp. 7\u201327. Springer, Heidelberg (2003)"},{"issue":"1-2","key":"20_CR3","first-page":"121","volume":"6","author":"R. Ceterchi","year":"2003","unstructured":"Ceterchi, R., Krithivasan, K.G.: Simple Circular Splicing Systems. Romanian J. Information Sci. and Technology\u00a06(1-2), 121\u2013134 (2003)","journal-title":"Romanian J. Information Sci. and Technology"},{"key":"20_CR4","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1007\/978-3-642-58117-5_23","volume-title":"Lindenmayer Systems; Impacts on Theoretical Computer Science and Developmental Biology","author":"T. Head","year":"1992","unstructured":"Head, T.: Splicing Schemes and DNA. In: Rozenberg, G., Salomaa, A. (eds.) Lindenmayer Systems; Impacts on Theoretical Computer Science and Developmental Biology, pp. 371\u2013383. Springer, Heidelberg (1992)"},{"key":"20_CR5","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"J.E. Hopcroft","year":"2001","unstructured":"Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (2001)"},{"key":"20_CR6","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, Reading (1979)"},{"key":"20_CR7","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0304-3975(85)90221-X","volume":"38","author":"M. Jantzen","year":"1985","unstructured":"Jantzen, M.: Extending Regular Expressions with Iterated Shuffle. Theoretical Computer Sci.\u00a038, 223\u2013247 (1985)","journal-title":"Theoretical Computer Sci."},{"key":"20_CR8","unstructured":"Kudlek, M., Mateescu, A.: Mix Operation with Catenation and Shuffle. In: Bozapalidis, S. (ed.) Proceedings of the 3rd International Conference Developments in Language Theory, Aristotle University Thessaloniki, pp. 387\u2013398 (1998)"},{"key":"20_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/3-540-45523-X_7","volume-title":"Multiset Processing","author":"M. Kudlek","year":"2001","unstructured":"Kudlek, M., Mart\u00edn-Vide, C., P\u0103un, G.: Toward FMT (Formal Macroset Theory). In: Calude, C.S., Pun, G., Rozenberg, G., Salomaa, A. (eds.) Multiset Processing. LNCS, vol.\u00a02235, pp. 123\u2013133. Springer, Heidelberg (2001)"},{"key":"20_CR10","series-title":"EATCS Monographs on TCS","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-69959-7","volume-title":"Semirings, Automata, Languages","author":"W. Kuich","year":"1986","unstructured":"Kuich, W., Salomaa, A.: Semirings, Automata, Languages. EATCS Monographs on TCS. Springer, Heidelberg (1986)"},{"key":"20_CR11","volume-title":"DNA Computing. New Computing Paradigms","author":"G. P\u0103un","year":"1998","unstructured":"P\u0103un, G., Rozenberg, G., Salomaa, A.: DNA Computing. New Computing Paradigms. Springer, Heidelberg (1998)"},{"key":"20_CR12","volume-title":"Formal Languages","author":"A. Salomaa","year":"1973","unstructured":"Salomaa, A.: Formal Languages. Academic Press, London (1973)"}],"container-title":["Lecture Notes in Computer Science","Aspects of Molecular Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24635-0_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,9]],"date-time":"2020-06-09T21:47:41Z","timestamp":1591739261000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24635-0_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540207818","9783540246350"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24635-0_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}