Abstract
The word substitutions are binary word operations which can be basically interpreted as a deletion followed by insertion, with some restrictions applied. Besides being itself an interesting topic in formal language theory, they have been naturally applied to modelling noisy channels. We introduce the concept of substitution on trajectories which generalizes a class of substitution operations. Within this framework, we study their closure properties and decision questions related to language equations. We also discuss applications of substitution on trajectories in modelling complex channels and a cryptanalysis problem.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Domaratzki, M.: Deletion along trajectories. Theoretical Computer Science 320, 293–313 (2004)
Domaratzki, M.: Splicing on Routes versus Shuffle and Deletion Along Trajectories. Tech. report 2003-471, School of Computing, Queen’s University (2003)
Domaratzki, M.: Decidability of Trajectory-Based Equations. Tech. report 2003-472, School of Computing, Queen’s University, 2003, and to appear in the proceedings of MFCS (2004)
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–319 (2003)
Ito, M., Kari, L., Thierrin, G.: Shuffle and scattered deletion closure of languages. Theoretical Computer Science 245, 115–133 (2000)
Kari, L.: On language equations with invertible operations. Theoretical Compute Science 132, 129–150 (1994)
Kari, L., Konstantinidis, S.: Language equations, maximality and error detection (submitted)
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’s University, Canada (2003)
Kari, L., Sosík, P.: Language deletion on trajectories. Dept. of Computer Science technical report No. 606, University of Western Ontario, London (2003) (submitted for publication)
Kari, L., Konstantinidis, S., Sosík, 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–Bicocca, pp. 375–384 (2004)
Kari, L., Konstantinidis, S., Sosík, P.: Substitution on trajectories. In: Karhumäki, J., Maurer, H., Păun, G., Rozenberg, G. (eds.) Theory Is Forever. LNCS, vol. 3113, pp. 145–158. Springer, Heidelberg (2004)
Konstantinidis, S.: An algebra of discrete channels that involve combinations of three basic error types. Information and Computation 167, 120–131 (2001)
Konstantinidis, S.: Transducers and the properties of error detection, error correction and finite-delay decodability. J. Universal Comp. Science 8, 278–291 (2002)
Mateescu, A., Salomaa, A.: Nondeterministic trajectories. In: Brauer, W., Ehrig, H., Karhumäki, J., Salomaa, A. (eds.) Formal and Natural Computing. LNCS, vol. 2300, pp. 96–106. Springer, Heidelberg (2002)
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–56 (1998)
Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages. Springer, Berlin (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kari, L., Konstantinidis, S., Sosík, P. (2005). Substitutions, Trajectories and Noisy Channels. In: Domaratzki, M., Okhotin, A., Salomaa, K., Yu, S. (eds) Implementation and Application of Automata. CIAA 2004. Lecture Notes in Computer Science, vol 3317. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30500-2_19
Download citation
DOI: https://doi.org/10.1007/978-3-540-30500-2_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24318-2
Online ISBN: 978-3-540-30500-2
eBook Packages: Computer ScienceComputer Science (R0)