Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 226,850,703 papers from all fields of science
Search
Sign In
Create Free Account
Complexity function
Known as:
Morse–Hedlund theorem
, Balanced word
, Balanced sequence
Expand
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
7 relations
Computer science
Hamming weight
Recurrent word
Regular language
Expand
Broader (1)
Theoretical computer science
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Auto and Cross Correlation of Well Balanced Sequence over Odd Characteristic Field
Arshad Ali
,
Nogami Yasuyuki
,
Inoue Hiroto
,
Uehara Satoshi
2016
Corpus ID: 116158569
2016
2016
Auto and Cross Correlation of Well Balanced Sequence over Odd Characteristic Field
Ali Md. Arshad
,
Y. Nogami
,
Hiroto Ino
,
S. Uehara
International Symposium on Computing and…
2016
Corpus ID: 10080906
In this paper, the authors have proposed a new approach for generating multi-value sequence by utilizing primitive element, trace…
Expand
2014
2014
Thai Phonetically Balanced Word Recognition Test : Test-retest Reliability and Error Analysis
A. Munthuli
,
C. Tantibundhit
,
C. Onsuwan
,
K. Kosawat
,
N. Klangpornkun
2014
Corpus ID: 145034511
To develop a new Thai word recognition test with emphasis on phonetic balance, reliability, and inter-list equivalency, Thammasat…
Expand
2013
2013
On the Asymptotic Abelian Complexity of Morphic Words
F. Blanchet-Sadri
,
Nathan Fox
International Conference on Developments in…
2013
Corpus ID: 15726110
The subword complexity of an infinite word counts the number of subwords of a given length, while the abelian complexity counts…
Expand
2012
2012
Quasi-linear Time Computation of the Abelian Periods of a Word
G. Fici
,
T. Lecroq
,
A. Lefebvre
,
Élise Prieur
,
W. F. Smyth
Prague Stringology Conference
2012
Corpus ID: 15446323
In the last couple of years many research papers have been devoted to Abelian complexity of words. Recently, Constantinescu and…
Expand
2010
2010
Research on autocorrelation of chaotic sequence by phase space method
Bin Chen
,
Peng Cai
,
Yong Zhang
,
Jian Huang
,
Yun-Song Wu
,
Jun Tang
IEEE International Conference on Wireless…
2010
Corpus ID: 15491503
Chaotic sequences have been widely used as pseudorandom sequences. But the problem of how to judge their autocorrelation function…
Expand
2009
2009
Complexité des pavages apériodiques : calculs et interprétations
A. Julien
2009
Corpus ID: 118866509
La theorie des pavages aperiodiques a connu des developpements rapides depuis les annees 1980, avec la decouvertes d'alliages…
Expand
Review
2005
Review
2005
A Survey of Phonetically Balanced Words Lists Used in Training Hospitals in Korea
S. Byun
,
S. Chung
,
Hansoo Kim
,
Y. Go
2005
Corpus ID: 74025734
Background and Objectives:Although several Korean PB (phonetically balanced word lists were proposed by many investigators, there…
Expand
Review
2000
Review
2000
Population biology of the annual grassTriplasis purpurea in relation to distance from shore on Staten Island, New York
G. P. Cheplick
,
H. Demetri
2000
Corpus ID: 55573042
Four populations of the native annual grassTriplasis purpurea were surveyed on coastal beaches along the south shore of Staten…
Expand
1998
1998
Implementing Real-time Video Decoding On Multimedia Processors By Complexity Prediction Techniques
M. Mattavelli
,
S. Brunetton
,
D. Mlynek
International Conference on Consumer Electronics
1998
Corpus ID: 39233879
The implementation of software based video/audio decoders is an advantageous solution over traditional dedicated hardware systems…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE