Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
In this paper, the authors have proposed a new approach for generating multi-value sequence by utilizing primitive element, trace… 
2014
2014
To develop a new Thai word recognition test with emphasis on phonetic balance, reliability, and inter-list equivalency, Thammasat… 
2013
2013
The subword complexity of an infinite word counts the number of subwords of a given length, while the abelian complexity counts… 
2012
2012
In the last couple of years many research papers have been devoted to Abelian complexity of words. Recently, Constantinescu and… 
2010
2010
Chaotic sequences have been widely used as pseudorandom sequences. But the problem of how to judge their autocorrelation function… 
2009
2009
La theorie des pavages aperiodiques a connu des developpements rapides depuis les annees 1980, avec la decouvertes d'alliages… 
Review
2005
Review
2005
Background and Objectives:Although several Korean PB (phonetically balanced word lists were proposed by many investigators, there… 
Review
2000
Review
2000
Four populations of the native annual grassTriplasis purpurea were surveyed on coastal beaches along the south shore of Staten… 
1998
1998
The implementation of software based video/audio decoders is an advantageous solution over traditional dedicated hardware systems…