Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
factor complexity
Description:
A measure in combinatorics on words that counts distinct contiguous subwords of each length in a finite or infinite word.
Primary topic:
semigroups and automata theory (80%)
Related topics:
semigroups and automata theory (80%),
Mathematical Dynamics and Fractals (9%)
OpenAlex ID:
keywords/factor-complexity
Differentiating motivation and control in the Theory of Planned Behavior
2004
·
RE Rhodes
, KS Courneya
·
Psychology Health & Medicine
·
174
Complexité des facteurs des mots infinis engendrés par morphismes itérés
1984
·
Jean-Jacques Pansiot
·
Lecture notes in computer science
·
139
Sur la complexité des suites infinies
1994
·
Jean-Paul Allouche
·
Bulletin of the Belgian Mathematical Society - Simon Stevin
·
131
Episturmian words: a survey
2009
·
Amy Glen
, Jacques Justin
·
RAIRO - Theoretical Informatics and Applications
·
114
PDF
Factor complexity of crash occurrence: An empirical demonstration using boosted regression trees
2012
·
Yi-Shih Chung
·
Accident Analysis & Prevention
·
104
A Characterization of Sturmian Words by Return Words
2001
·
Laurent Vuillon
·
European Journal of Combinatorics
·
104
PDF
Return words in Sturmian and episturmian words
2000
·
Jacques Justin
, Laurent Vuillon
·
RAIRO - Theoretical Informatics and Applications
·
94
PDF
Concurrent validity of four androgyny instruments
1984
·
F. Robert Wilson
, Ellen Piel Cook
·
Sex Roles
·
84
The Automorphism Group of a Shift of Linear Growth: Beyond Transitivity
2015
·
VAN CYR
, BRYNA KRA
·
Forum of Mathematics Sigma
·
83
PDF
Factor complexity
2010
·
J. Cassaigne
, F. Nicolas
·
Cambridge University Press eBooks
·
81
The FC1 Rule of Identification for Confirmatory Factor Analysis: A General Sufficient Condition
1993
·
WALTER R. DAVIS
·
Sociological Methods & Research
·
75
On the conjugation of standard morphisms
1998
·
Patrice Séébold
·
Theoretical Computer Science
·
72
Sequences with grouped factors.
1997
·
Julien Cassaigne
·
Developments in Language Theory
·
68
Words and forbidden factors
2002
·
F. Mignosi
, A. Restivo
, et al.
·
Theoretical Computer Science
·
67
PDF
Episturmian words: a survey
2009
·
Amy Glen
, Jacques Justin
·
Murdoch University Research Portal
·
62
Formal Languages, Automata and Numeration Systems 1: Introduction to Combinatorics on Words
2014
·
Michel Rigo
·
Wiley eBooks
·
61
A connection between palindromic and factor complexity using return words
2008
·
Michelangelo Bucci
, Alessandro De Luca
, et al.
·
Advances in Applied Mathematics
·
58
PDF
Sequences with constant number of return words
2008
·
L’ubomíra Balková
, Edita Pelantová
, et al.
·
Monatshefte für Mathematik
·
56
PDF
Factor versus palindromic complexity of uniformly recurrent infinite words
2007
·
Peter Baláži
, Zuzana Masáková
, et al.
·
Theoretical Computer Science
·
54
PDF
Special factors, periodicity, and an application to Sturmian words
2000
·
Arturo Carpi
, Aldo de Luca
·
Acta Informatica
·
52
Words and special factors
2001
·
Arturo Carpi
, Aldo de Luca
·
Theoretical Computer Science
·
51
PDF
The number of factors in a paperfolding sequence
1992
·
Jean-Paul Allouche
·
Bulletin of the Australian Mathematical Society
·
47
PDF
Sequences generated by infinitely iterated morphisms
1985
·
Patrice Séébold
·
Discrete Applied Mathematics
·
38
The finite index basis property
2014
·
Valérie Berthé
, Clelia De Felice
, et al.
·
Journal of Pure and Applied Algebra
·
36
Computing the k-binomial Complexity of the Thue–Morse Word
2019
·
Marie Lejeune
, Julien Leroy
, et al.
·
Journal of Combinatorial Theory Series A
·
33
Show more works
View as search
Works count:
298
Citation count:
3,532
Year
Topic
Type