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.
Review
2013
Review
2013
Blood carries a wide array of biomolecules, including nutrients, hormones, and moleculesthat are secreted by cells for specific… 
2011
2011
For assessment of hearing assistance devices, a speaker discrimination test was developed. The speech material was drawn from a… 
2010
2010
Chaotic sequences have been widely used as pseudorandom sequences. But the problem of how to judge their autocorrelation function… 
2006
2006
In this paper we present two methods to construct iteratively bent functions of n + 2 variables from bent functions of n… 
2006
2006
In this paper we present a new method to construct iteratively new bent functions of n + 2 variables from a bent functions of n… 
Review
2005
Review
2005
Background and Objectives:Although several Korean PB (phonetically balanced word lists were proposed by many investigators, there… 
2000
1988
1988
The authors describe a method to represent, acquire and implement acoustic-phonetic knowledge for large vocabulary word… 
1981
1981
Abstract : This report is made up of a series of individual papers on techniques to enhance the behavioral research methods being…