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… 
2013
2013
We study two relations on multi-dimensional subshifts: A pre-order based on the patterns configurations contain and the Cantor… 
2013
2013
The subword complexity of an infinite word counts the number of subwords of a given length, while the abelian complexity counts… 
2010
2010
Chaotic sequences have been widely used as pseudorandom sequences. But the problem of how to judge their autocorrelation function… 
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… 
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…