Substitutions, trajectories and noisy channels

Authors:
Lila Kari;Stavros Konstantinidis;Petr Sosík
Affiliations:
Department of Computer Science, The University of Western Ontario, London, ON, Canada;Dept. of Mathematics and Computing Science, Saint Mary’s University, Halifax, Nova Scotia, Canada;Department of Computer Science, The University of Western Ontario, London, ON, Canada
Venue:
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
Year:
2004

Citing 8
Cited 3

On language equations with invertible operations

Theoretical Computer Science
Shuffle on trajectories: syntactic constraints

Theoretical Computer Science
Shuffle and scattered deletion closure of languages

Theoretical Computer Science
An algebra of discrete channels that involve combinations of three basic errors types

Information and Computation
Handbook of Formal Languages

Handbook of Formal Languages
Nondeterministic trajectories

Formal and natural computing
Deletion along trajectories

Theoretical Computer Science
Preventing undesirable bonds between DNA codewords

DNA'04 Proceedings of the 10th international conference on DNA computing

Interpreted Trajectories

Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Algebraic properties of substitution on trajectories

Theoretical Computer Science
Interpreted Trajectories

Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu

Quantified Score

Hi-index	0.00

Visualization

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.