• Corpus ID: 10390183

On Exchange-Robust and Subst-Robust Primitive Partial Words

  title={On Exchange-Robust and Subst-Robust Primitive Partial Words},
  author={Ananda Chandra Nayak and Amit Kumar Srivastava and Kalpesh Kapoor},
A partial word is a word that may have some unknown places known as “holes” and can be replaced by the symbols from the underlying alphabet. A partial word u is said to be primitive if there does not exist a word v such that u is contained in a nontrivial integer power of v. We study the preservation of primitivity in partial words by the effect of some point mutation operations. In this paper, we investigate the effect of exchanging two adjacent symbols and of substituting a symbol by another… 


On Del-Robust Primitive Partial Words with One Hole
A special class of words is characterized, del-robust primitive partial words with one hole, that remains primitive on deletion of any symbol or the hole, and it is proved that the language of non-del-robUST primitive partial Words with one Hole is not context-free.
On Operations Preserving Primitivity of Partial Words with One Hole
This work investigates operations that preserve the primitivity of partial words with one hole, or words that have an undefined position, and finds that all primitive binary partial words of length up to 11 can be generated.
Algorithmic Combinatorics on Partial Words
This paper focuses on two areas of algorithmic combinatorics on partial words, namely, pattern avoidance and subword complexity, and discusses recent contributions as well as a number of open problems.
Some operations preserving primitivity of words
The operations are chosen in such a way that in the case of a two-letter alphabet, all primitive words of length @?11 can be obtained from single letters.
Primitive Morphisms
  • V. Mitrana
  • Computer Science, Mathematics
    Inf. Process. Lett.
  • 1997
A precise characterization of primitive morphisms is provided in terms of pure codes and an easily testable characterization is given for uniform morphisms over the binary alphabet.
Primitive partial words
Some fundamental results about primitive words are extended to primitive partial words, which are strings that may have a number of ''do not know'' symbols.
Context-Free Languages And Primitive Words
This chapter discusses combinatorial properties of words and Languages Iteration Lemmata, as well as characterizations of Context-Free Languages Palindromic, Slender and Polyslender Languages.
Partial Words and a Theorem of Fine and Wilf
A variant of Fine and Wilf's theorem for partial words is proved, and extensions of some general combinatorial properties of words are given.
On the robustness of primitive words
This work investigates the effect on primitive words of point mutations, of morphisms, and of the operation of taking prefixes, and several ways of producing primitive words are obtained.
A helpful result for proving inherent ambiguity
  • W. Ogden
  • Computer Science
    Mathematical systems theory
  • 2005
A slightly stronger result is presented which can be used to prove the inherent ambiguity of certain context-free languages and is based on Bar-Hillel, Perles and Shamir's theorem.