Results 141 to 150 of about 1,541,664 (157)
Some of the next articles are maybe not open access.
Subword complexity of a generalized Thue-Morse word
Information Processing Letters, 1995zbMATH Open Web Interface contents unavailable due to conflicting licenses.
John Tromp, Jeffrey Shallit
exaly +4 more sources
2012
The subword complexity of an infinite word ξ is a function f(ξ,n) returning the number of finite subwords (factors, infixes) of length n of ξ. In the present paper we investigate infinite words for which the set of subwords occurring infinitely often is a regular language. Among these infinite words we characterise those which are eventually recurrent.
openaire +2 more sources
The subword complexity of an infinite word ξ is a function f(ξ,n) returning the number of finite subwords (factors, infixes) of length n of ξ. In the present paper we investigate infinite words for which the set of subwords occurring infinitely often is a regular language. Among these infinite words we characterise those which are eventually recurrent.
openaire +2 more sources
Frequencies of subwords in words of linear subword complexity
11 ...Bell, Jason +2 more
openaire +1 more source
On the subword complexity of iteratively generated infinite words
Discrete Applied Mathematics, 2001 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
exaly +3 more sources
On the subword complexity of m-free D0L languages
Information Processing Letters, 1983Abstract A word is called m-free (m ⩾ 2) if it does not contain a subword of the form xm where x is a nonempty word. A language is called m-free if it consists of m-free words only. The subword complexity of a language K, denoted πK, is a function of positive integers which to each positive integer n assigns the number of different subwords of length
A Ehrenfeucht
exaly +2 more sources
Subword Complexity in Free Groups
2013Subword complexity is a basic invariant for words on a finite alphabet. I will explain how one can define a complexity for points in the boundary of a finitely generated free group F or for a lamination on F. This complexity, or rather the way it grows, is invariant under automorphisms of F and may be interpreted geometrically. I will discuss a version
openaire +1 more source
Quasiperiods, Subword Complexity and the Smallest Pisot Number
J. Autom. Lang. Comb., 2016Journal of Automata, Languages and Combinatorics, Volume 21, Numbers 1-2, 2016, 93 ...
Ronney Polley, Ludwig Staiger
openaire +2 more sources
Scattered Subword Complexity of Non-Primitive Words
J. Autom. Lang. Comb., 2008In this paper we analyze primitive words from the point of view of their scattered subwords. The language of primitive words has been the subject of numerous studies. It is the language of the words that are not proper powers of another word. First we take a look at the Parikh-vectors of these words, that is, we consider the commutative closure of ...
Szilárd Zsolt Fazekas, Benedek Nagy
openaire +2 more sources
On the subword complexity and square-freeness of formal languages
2005A Ehrenfeucht
exaly +3 more sources
On Bispecial Words and Subword Complexity of DOL Sequences *
1999We study thesubword complexityof a sequence which counts the number of its distinct factors of a given length. Using the technique ofbispecial words, we find an explicit formula for the subword complexity of a wide class of DOL sequences. We also obtain the characterization of bispecial factors and minimalforbidden wordsof that class of sequences.
Anna E. Frid, Sergey V. Avgustinovich
openaire +2 more sources