Results 171 to 180 of about 8,270 (198)
Some of the next articles are maybe not open access.
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 +1 more source
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 +1 more source
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.
Ehrenfeucht, A., Rozenberg, G.
openaire +2 more sources
Relationally Periodic Sequences and Subword Complexity
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
openaire +1 more source
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
Subword complexity of a generalized Thue-Morse word
Information Processing Letters, 1995zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Tromp, John, Shallit, Jeffrey
openaire +2 more sources
On Subword Complexity of Morphic Sequences
2008We sketch the proof of the following result: the subword complexity of arbitrary morphic sequence is either Θ(n2), or O(n3/2).
openaire +1 more source
Estimation of Entropy from Subword Complexity
2015Subword complexity is a function that describes how many different substrings of a given length are contained in a given string. In this paper, two estimators of block entropy are proposed, based on the profile of subword complexity. The first estimator works well only for IID processes with uniform probabilities.
openaire +1 more source
Increasing the size and complexity of discrete 2D metallosupramolecules
Nature Reviews Materials, 2021Heng Wang, Yiming Li, Na Li
exaly
Economic complexity theory and applications
Nature Reviews Physics, 2021Cesar Hidalgo, César A Hidalgo
exaly
Predictive biology: modelling, understanding and harnessing microbial complexity
Nature Reviews Microbiology, 2020Allison J Lopatkin, James J Collins
exaly