Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Complexity function

Known as: Morse–Hedlund theorem, Balanced word, Balanced sequence 
In computer science, the complexity function of a string, a finite or infinite sequence of letters from some alphabet, is the function that counts… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2012
Highly Cited
2012
Algorithmic combinatorics on partial words, or sequences of symbols over a finite alphabet that may have some do-not-know symbols… Expand
Is this relevant?
Highly Cited
2011
Highly Cited
2011
In this paper we undertake the general study of the Abelian complexity of an infinite word on a finite alphabet. We investigate… Expand
Is this relevant?
2007
2007
It is a difficult problem to make drivers drowsiness detection meet the needs of real time in embedded system; meanwhile, there… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 6
  • figure 4
Is this relevant?
2006
2006
. The embryonic development in Chione cancellata, from fertilization to straight-hinge D-stage veliger larva, occurs in 24 h at… Expand
  • figure 10
  • figure 12
  • figure 21
  • figure 29
  • figure 30
Is this relevant?
Highly Cited
2002
Highly Cited
2002
Edith Penrose's (1959) book, The Theory of the Growth of the Firm, is considered by many scholars in the strategy field to be the… Expand
  • figure 1
Is this relevant?
Highly Cited
2001
Highly Cited
2001
We consider the implementation of abstract data types for the static objects: binary tree, rooted ordered tree, and a balanced… Expand
  • figure 3.1
  • figure 4.1
Is this relevant?
2000
2000
Feedforward neural networks (FNN) have been used intensively for the identification and control of chemical engineering processes… Expand
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • table 2
Is this relevant?
Highly Cited
1999
Highly Cited
1999
Abstract A new method is proposed for classifying sets of a variable number of points and curves in a multidimensional space as… Expand
Is this relevant?
Highly Cited
1997
Highly Cited
1997
AbstractWe define an invariant of measure-theoretic isomorphism for dynamical systems, as the growth rate inn of the number of… Expand
Is this relevant?
Highly Cited
1996
Highly Cited
1996
We investigate the relation between the complexity function of a sequence, that is the number p(n) of its factors of length n… Expand
Is this relevant?