{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:13:19Z","timestamp":1725549199791},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540243182"},{"type":"electronic","value":"9783540305002"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-30500-2_19","type":"book-chapter","created":{"date-parts":[[2010,3,1]],"date-time":"2010-03-01T16:39:36Z","timestamp":1267461576000},"page":"202-212","source":"Crossref","is-referenced-by-count":1,"title":["Substitutions, Trajectories and Noisy Channels"],"prefix":"10.1007","author":[{"given":"Lila","family":"Kari","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stavros","family":"Konstantinidis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Petr","family":"Sos\u00edk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","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. Theoretical Computer Science\u00a0320, 293\u2013313 (2004)","journal-title":"Theoretical Computer Science"},{"key":"19_CR2","unstructured":"Domaratzki, M.: Splicing on Routes versus Shuffle and Deletion Along Trajectories. Tech. report 2003-471, School of Computing, Queen\u2019s University (2003)"},{"key":"19_CR3","unstructured":"Domaratzki, M.: Decidability of Trajectory-Based Equations. Tech. report 2003-472, School of Computing, Queen\u2019s University, 2003, and to appear in the proceedings of MFCS (2004)"},{"key":"19_CR4","unstructured":"Domaratzki, M., Mateescu, A., Salomaa, K., Yu, S.: Deletion on Trajectories and Commutative Closure. In: Harju, T., Karhumaki, J. (eds.) WORDS 2003: 4th International Conference on Combinatorics on Words, TUCS General Publication No. 27, August 2003, pp. 309\u2013319 (2003)"},{"key":"19_CR5","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/S0304-3975(99)00277-7","volume":"245","author":"M. Ito","year":"2000","unstructured":"Ito, M., Kari, L., Thierrin, G.: Shuffle and scattered deletion closure of languages. Theoretical Computer Science\u00a0245, 115\u2013133 (2000)","journal-title":"Theoretical Computer Science"},{"key":"19_CR6","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/0304-3975(94)90230-5","volume":"132","author":"L. Kari","year":"1994","unstructured":"Kari, L.: On language equations with invertible operations. Theoretical Compute Science\u00a0132, 129\u2013150 (1994)","journal-title":"Theoretical Compute Science"},{"key":"19_CR7","unstructured":"Kari, L., Konstantinidis, S.: Language equations, maximality and error detection (submitted)"},{"key":"19_CR8","unstructured":"Kari, L., Konstantinidis, S., Perron, S., Wozniak, G., Xu, J.: Finite-state error\/editsystems and difference measures for languages and words. Dept. of Math. and Computing Sci. Tech. Report No. 2003-01, Saint Mary\u2019s University, Canada (2003)"},{"key":"19_CR9","unstructured":"Kari, L., Sos\u00edk, P.: Language deletion on trajectories. Dept. of Computer Science technical report No. 606, University of Western Ontario, London (2003) (submitted for publication)"},{"key":"19_CR10","unstructured":"Kari, L., Konstantinidis, S., Sos\u00edk, P.: Preventing undesirable bonds between DNA codewords. In: Feretti, C., Mauri, G., Zandron, C. (eds.) DNA 10, Tenth International Meeting on DNA Computing, University of Milano\u2013Bicocca, pp. 375\u2013384 (2004)"},{"key":"19_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/978-3-540-27812-2_14","volume-title":"Theory Is Forever","author":"L. Kari","year":"2004","unstructured":"Kari, L., Konstantinidis, S., Sos\u00edk, P.: Substitution on trajectories. In: Karhum\u00e4ki, J., Maurer, H., P\u0103un, G., Rozenberg, G. (eds.) Theory Is Forever. LNCS, vol.\u00a03113, pp. 145\u2013158. Springer, Heidelberg (2004)"},{"key":"19_CR12","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1006\/inco.2001.3035","volume":"167","author":"S. Konstantinidis","year":"2001","unstructured":"Konstantinidis, S.: An algebra of discrete channels that involve combinations of three basic error types. Information and Computation\u00a0167, 120\u2013131 (2001)","journal-title":"Information and Computation"},{"key":"19_CR13","first-page":"278","volume":"8","author":"S. Konstantinidis","year":"2002","unstructured":"Konstantinidis, S.: Transducers and the properties of error detection, error correction and finite-delay decodability. J. Universal Comp. Science\u00a08, 278\u2013291 (2002)","journal-title":"J. Universal Comp. Science"},{"key":"19_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/3-540-45711-9_7","volume-title":"Formal and Natural Computing","author":"A. Mateescu","year":"2002","unstructured":"Mateescu, A., Salomaa, A.: Nondeterministic trajectories. In: Brauer, W., Ehrig, H., Karhum\u00e4ki, J., Salomaa, A. (eds.) Formal and Natural Computing. LNCS, vol.\u00a02300, pp. 96\u2013106. Springer, Heidelberg (2002)"},{"key":"19_CR15","doi-asserted-by":"crossref","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, TUCS Technical Report No. 41, Turku Centre for Computer Science (1996); Theoretical Computer Science 197, 1\u201356 (1998)","journal-title":"Theoretical Computer Science"},{"volume-title":"Handbook of Formal Languages","year":"1997","key":"19_CR16","unstructured":"Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages. Springer, Berlin (1997)"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30500-2_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:57:11Z","timestamp":1605761831000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30500-2_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540243182","9783540305002"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30500-2_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}