1,787 research outputs found
Minimal Forbidden Factors of Circular Words
Minimal forbidden factors are a useful tool for investigating properties of
words and languages. Two factorial languages are distinct if and only if they
have different (antifactorial) sets of minimal forbidden factors. There exist
algorithms for computing the minimal forbidden factors of a word, as well as of
a regular factorial language. Conversely, Crochemore et al. [IPL, 1998] gave an
algorithm that, given the trie recognizing a finite antifactorial language ,
computes a DFA recognizing the language whose set of minimal forbidden factors
is . In the same paper, they showed that the obtained DFA is minimal if the
input trie recognizes the minimal forbidden factors of a single word. We
generalize this result to the case of a circular word. We discuss several
combinatorial properties of the minimal forbidden factors of a circular word.
As a byproduct, we obtain a formal definition of the factor automaton of a
circular word. Finally, we investigate the case of minimal forbidden factors of
the circular Fibonacci words.Comment: To appear in Theoretical Computer Scienc
Envelope Word and Gap Sequence in Doubling Sequence
Let be a factor of Doubling sequence , then
it occurs in the sequence infinitely many times. Let be the -th
occurrence of and be the gap between and
. In this paper, we discuss the structure of the gap sequence
. We prove that all factors can be divided into two
types, one type has exactly two distinct gaps and ,
the other type has exactly three distinct gaps , and
. We determine the expressions of gaps completely. And also give
the substitution of each gap sequence. The main tool in this paper is "envelope
word", which is a new notion, denoted by . As an application, we
determine the positions of all , discuss some combinatorial
properties of factors, and count the distinct squares beginning in
for .Comment: 14 pages, 7 figures. arXiv admin note: text overlap with
arXiv:1408.372
- …