Results 1  10
of
14
Special Factors of Sequences With Linear Subword Complexity
 In Developments in Language Theory
, 1996
"... In this paper, we prove the following result, which was conjectured by S. Ferenczi: if the complexity function of a sequence has linear growth, then its differences are bounded by a constant. ..."
Abstract

Cited by 12 (2 self)
 Add to MetaCart
In this paper, we prove the following result, which was conjectured by S. Ferenczi: if the complexity function of a sequence has linear growth, then its differences are bounded by a constant.
On RepetitionFree Binary Words of Minimal Density
 Theoretical Computer Science
, 1999
"... We study the minimal proportion (density) of one letter in nth powerfree binary words. First, we introduce and analyse a general notion of minimal letter density for any innite set of words which don't contain a specied set of \prohibited" subwords. We then prove that for nth powerfre ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
We study the minimal proportion (density) of one letter in nth powerfree binary words. First, we introduce and analyse a general notion of minimal letter density for any innite set of words which don't contain a specied set of \prohibited" subwords. We then prove that for nth powerfree binary words the density function is 1 n + 1 n 3 + 1 n 4 + O( 1 n 5 ). We also consider a generalization of nth powerfree words for fractional powers (exponents): a word is xth powerfree for a real x, if it does not contain subwords of exponent x or more. We study the minimal proportion of one letter in xth powerfree binary words as a function of x and prove, in particular, that this function is discontinuous at 7 3 as well as at all integer points n 3. Finally, we give an estimate of the size of the jumps. Keywords: Unavoidable patterns, powerfree words, exponent, minimal density. 1 Introduction One of classical topics of formal language theory and word combinatorics is th...
An algorithm to test if a given circular HDOLlanguage avoids a pattern
 in: IFIP World Computer Congress'94
, 1994
"... To prove that a pattern p is avoidable on a given alphabet, one has to construct an infinite language L that avoids p. Usually, L is a DOLlanguage (obtained by iterating a morphism h) or a HDOLlanguage (obtained by coding a DOLlanguage with another morphism g). Our purpose is to find an algorithm ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
To prove that a pattern p is avoidable on a given alphabet, one has to construct an infinite language L that avoids p. Usually, L is a DOLlanguage (obtained by iterating a morphism h) or a HDOLlanguage (obtained by coding a DOLlanguage with another morphism g). Our purpose is to find an algorithm to test, given a HDOLsystem G, whether the language L(G) generated by this system avoids p. We first define the notions of circular morphism, circular DOLsystem and circular HDOLsystem, and we show how to compute the inverse image of a pattern by a circular morphism. Then we prove that by computing successive inverse images of p, we can decide whether the language L(G) avoids p for any fixed pattern p (which may even contain constants), provided that the HDOLsystem G is circular and expansive. 1 Introduction The theory of avoidable patterns, introduced by Zimin [13] and Bean, Ehrenfeucht and McNulty [2], generalizes problems studied by Axel Thue [12] and many others, such as the ex...
No iterated morphism generates any Arshon sequence of odd order
 Discr. Math
"... We show that no Arshon sequence of odd order can be generated by an iterated morphism. This solves a problem of Kitaev and generalizes results of Berstel and of Kitaev. Keywords: Combinatorics on words, nonrepetitive words, Arshon’s sequence, DOL systems 1 ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
We show that no Arshon sequence of odd order can be generated by an iterated morphism. This solves a problem of Kitaev and generalizes results of Berstel and of Kitaev. Keywords: Combinatorics on words, nonrepetitive words, Arshon’s sequence, DOL systems 1
Patterns in Words Versus Patterns in Trees: A Brief Survey and New Results
 International Conference &quot;Perspectives of Systems Informatics
, 1999
"... In this paper we study some natural problems related to specifying sets of words and trees by patterns. ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
In this paper we study some natural problems related to specifying sets of words and trees by patterns.
Words strongly avoiding fractional powers
 Europ. J. of Combinatorics
, 1999
"... Abstract Let k be fixed, 1! k! 2. There exists an infinite word over a finite alphabet which contains no subword of the form xyz with jxyzj=jxyj * k and where z is a permutation of x. 1 Introduction Nonrepetitive words have been studied since Thue [34]. A word is nonrepetitive if it cannot be writt ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract Let k be fixed, 1! k! 2. There exists an infinite word over a finite alphabet which contains no subword of the form xyz with jxyzj=jxyj * k and where z is a permutation of x. 1 Introduction Nonrepetitive words have been studied since Thue [34]. A word is nonrepetitive if it cannot be written xyyz, where x; y; z are words, and y is nonempty. Infinite
Minimal Letter Frequency in NTh PowerFree Binary Words
 in Mathematical Foundations of Computer Science 1997, Lecture Notes in Comput. Sci., 1295, eds. I. Privara and P. Ru˘zička
, 1997
"... We show that the minimal proportion of one letter in an nth powerfree binary word is asymptotically 1=n. We also consider a generalization of nth powerfree words defined through the notion of exponent: a word is xth powerfree for a real x, if it does not contain subwords of exponent x or more. ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We show that the minimal proportion of one letter in an nth powerfree binary word is asymptotically 1=n. We also consider a generalization of nth powerfree words defined through the notion of exponent: a word is xth powerfree for a real x, if it does not contain subwords of exponent x or more. We study the minimal proportion of one letter in an xth powerfree binary word as a function of x and prove, in particular, that this function is discontinuous. 1 Introduction One of classical topics of formal language theory and word combinatorics is the construction of infinite words verifying certain restrictions. A typical restriction is the requirement that the word does not contain a subword of the form specified by some general pattern. Results of this kind find their applications in different areas such as algebra, number theory, game theory (see [12, 16]). The oldest results of this kind, dating back to the beginning of the century, are Thue's famous constructions of infinite squ...
Languages Obtained From Infinite Words
, 1996
"... Answering two problems formulated by Marcus and Paun, we prove that it is decidable whether or not a contextfree language can be written as the set of all finite prefixes of an infinite word and that it is decidable whether or not a regular language can be written as the set of all finite subwords ..."
Abstract
 Add to MetaCart
Answering two problems formulated by Marcus and Paun, we prove that it is decidable whether or not a contextfree language can be written as the set of all finite prefixes of an infinite word and that it is decidable whether or not a regular language can be written as the set of all finite subwords of an infinite word. TUCS Research Group