Applications of Transducers in Independent Languages, Word Distances, Codes - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2017

Applications of Transducers in Independent Languages, Word Distances, Codes

Stavros Konstantinidis
  • Function : Author
  • PersonId : 1024591

Abstract

A (nondeterministic) transducer t is an operator mapping an input word to a set of possible output words. A few types of transducers are important in this work: input-altering, input-preserving, and input-decreasing. Two words are t-dependent, if one is the output of t when the other one is used as input. A t-independent language is one containing no two t-dependent words. Examples of independent languages are found in noiseless coding theory, noisy coding theory and DNA computing. We discuss how the above transducer types can provide elegant solutions to some cases of the following broad problems: (i) computing two minimum distance witness words of a given regular language; (ii) computing witness words for the non-satisfaction, or non-maximality, of a given regular language with respect to the independence specified by a given transducer t; (iii) computing, for any given t and language L, a maximal t-independent language containing L; (iv) computing, for any given positive integer n and transducer t, a t-independent language of n words. The descriptional complexity cost of converting between transducer types is discussed, when this conversion is possible. We also explore methods of defining more independences in a way that some of the above problems can still be computed.
Fichier principal
Vignette du fichier
440206_1_En_4_Chapter.pdf (382.84 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01657012 , version 1 (06-12-2017)

Licence

Attribution

Identifiers

Cite

Stavros Konstantinidis. Applications of Transducers in Independent Languages, Word Distances, Codes. 19th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2017, Milano, Italy. pp.45-62, ⟨10.1007/978-3-319-60252-3_4⟩. ⟨hal-01657012⟩
40 View
67 Download

Altmetric

Share

Gmail Facebook X LinkedIn More