Results 161 to 170 of about 6,384 (182)

On the Language of Primitive Partial Words

Lecture Notes in Computer Science, 2015
A partial word is a word which contains some holes known as do not know symbols and such places can be replaced by any letter from the underlying alphabet. We study the relation between language of primitive partial words with the conventional language classes viz. regular, linear and deterministic context-free in Chomsky hierarchy.
Kalpesh Kapoor
exaly   +2 more sources

On Del-Robust Primitive Partial Words with One Hole

Lecture Notes in Computer Science, 2016
A partial word is a string over a finite alphabet with some undefined places which are known as holes or “do not know” symbols. A partial word w is said to be primitive if there does not exist any word v such that w is contained in \(v^n\) with \(n \ge 2\). We investigate the effect of a point mutation on primitive partial words with a single hole.
Ananda Chandra Nayak, Amit Kumar Srivastava   +1 more
exaly   +2 more sources

Computing primitively-rooted squares and runs in partial words

European Journal of Combinatorics, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Francine Blanchet-Sadri, Justin Lazarow, Jordan Nikkel, J. D. Quigley, Xufan Zhang   +4 more
openaire   +1 more source

Counting Primitive Partial Words

J. Autom. Lang. Comb., 2010
A word is primitive if it is not a power of another word. The number of primitive words of a fixed length over an alphabet of a fixed size is well known and relates to the Möbius function. In this paper, we investigate the number of primitive partial words which are strings that may contain "do not know" symbols.
Francine Blanchet-Sadri, Mihai Cucuringu
openaire   +1 more source

Computing Primitively-Rooted Squares and Runs in Partial Words

2015
This paper deals with two types of repetitions in strings: squares, which consist of two adjacent occurrences of substrings, and runs, which are periodic substrings that cannot be extended further to the left or right. We show how to compute all the primitively-rooted squares in a given partial word, which is a sequence that may have undefined ...
Francine Blanchet-Sadri, Jordan Nikkel, J. D. Quigley, Xufan Zhang   +3 more
openaire   +1 more source

Periodicity properties on partial words

Information and Computation, 2008
F Blanchet-Sadri
exaly  

Primitive Partial Words

2007
openaire   +1 more source

Counting bordered and primitive words with a fixed weight

Theoretical Computer Science, 2005
Tero Harju, Dirk Nowotka
exaly  

On del-robust primitive words

Discrete Applied Mathematics, 2016
Amit Kumar Srivastava, Kalpesh Kapoor
exaly  

Generalized de Bruijn words for primitive words and powers

Discrete Mathematics, 2015
Yu Hin Au
exaly