AVOIDING ABELIAN POWERS IN BINARY WORDS WITH BOUNDED ABELIAN COMPLEXITY (Q3016224): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1005.2514 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symbolic Dynamics II. Sturmian Trajectories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balance and abelian complexity of the Tribonacci word / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balances and Abelian Complexity of a Certain Class of Infinite Ternary Words / rank
 
Normal rank
Property / cites work
 
Property / cites work: On uniformly repetitive semigroups / rank
 
Normal rank
Property / cites work
 
Property / cites work: On nonrepetitive sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strongly non-repetitive sequences and progression-free sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Second Course in Formal Languages and Automata Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balances for fixed points of primitive substitutions. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of substitutive sequences using return words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cobham-Semenov theorem and \(\mathbb N^d\)-subshifts / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2119013637 / rank
 
Normal rank

Latest revision as of 11:11, 30 July 2024

scientific article
Language Label Description Also known as
English
AVOIDING ABELIAN POWERS IN BINARY WORDS WITH BOUNDED ABELIAN COMPLEXITY
scientific article

    Statements

    Identifiers