Results 71 to 80 of about 114 (95)
On the shape of subword complexity sequences of finite words
CoRR, 2013 The subword complexity of a word $w$ over a finite alphabet $\mathcal{A}$ is a function that assigns for each positive integer $n$, the number of distinct subwords of length $n$ in $w$. The subword complexity of a word is a good measure of the randomness of the word and gives insight to what the word itself looks like.
openaire +2 more sources
On subword complexities of homomorphic images of languages [PDF]
RAIRO. Informatique théorique, 1982 Andrzej Ehrenfeucht, Grzegorz Rozenberg
openaire +2 more sources
Subword complexity and finite characteristic numbers
Actes des rencontres du CIRM, 2010 Summary: Decimal expansions of classical constants such as \(\sqrt{2}\), \(\pi\) and \(\zeta(3)\) have long been a source of difficult questions. In the case of finite characteristic numbers (Laurent series with coefficients in a finite field), where no carry-over difficulties appear, the situation seems to be simplified and drastically different.
openaire +2 more sources
A note on the subword complexes in Coxeter groups
, 2008 We prove that the Stanley--Reisner ideal of the Alexander dual of the subword complexes in Coxeter groups has linear quotients with respect to the lexicographical order of the minimal monomial generators. As a consequence, we obtain a shelling order on the facets of the subword complex.
openaire +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
An improvement of subword complexity
Random Operators and Stochastic Equations, 2011Abstract In this article we propose a simple method to estimate the complexity of a finite word written over a finite alphabet. We use the notion of subword complexity (which is equal to the number of different subwords in the word) as a starting point and show the computation difficulties connected with the usage of subword ...
Evgeny Ivanko
exaly +2 more sources
Subword Complexity in Free Groups
Lecture Notes in Computer Science, 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
Gilbert Levitt
exaly +2 more sources
Relationally Periodic Sequences and Subword Complexity
Lecture Notes in Computer Science, 2008By the famous theorem of Morse and Hedlund, a word is ultimately periodic if and only if it has bounded subword complexity, i.e., for sufficiently large n, the number of factors of length nis constant. In this paper we consider relational periods and relationally periodic sequences, where the relation is a similarity relation on words induced by a ...
Julien Cassaigne +2 more
exaly +2 more sources
On the subword complexity of locally catenative dol languages
Information Processing Letters, 1983Abstract The subword complexity of language K, denoted Gv; K , is the function of positive integers such that Gv; K (n) equals the number of subwords of length n that occur in (words of) K. It is proved that if K is a locally catenative DOL language, then Gv; K is bounded by a linear function.
A Ehrenfeucht, G Rozenberg
exaly +3 more sources
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 +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, G Rozenberg
exaly +2 more sources