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.
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… 
2009
2009
La theorie des pavages aperiodiques a connu des developpements rapides depuis les annees 1980, avec la decouvertes d'alliages… 
2006
2006
In this paper we present two methods to construct iteratively bent functions of n + 2 variables from 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
1994
1994
The paper describes a new method for representing and identifying isolated word accent patterns. The word accent patterns are… 
1994
1994
For a binary pseudorandom sequence {Si} with period N , the partial period autocorrelation function AS(τ, k, D) is defined by… 
1981
1981
Abstract : This report is made up of a series of individual papers on techniques to enhance the behavioral research methods being…