On a generalization of abelian equivalence and complexity of infinite words (Q388738): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q223814
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Juhani Karhumäki / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2012233760 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1301.5104 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinite permutations of lowest maximal pattern complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some characterizations of Sturmian words in terms of the lexicographic order / rank
 
Normal rank
Property / cites work
 
Property / cites work: AVOIDING ABELIAN POWERS IN BINARY WORDS WITH BOUNDED ABELIAN COMPLEXITY / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequences with minimal block growth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recurrent words with constant abelian complexity / 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: Episturmian words and some constructions of de Luca and Rauzy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elementary homomorphisms and a solution of the DOL sequence equivalence problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized balances in Sturmian words / rank
 
Normal rank
Property / cites work
 
Property / cites work: On periodicity and low complexity of infinite permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On factor graphs of DOL words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Existence of an infinite ternary 64-abelian square-free word / rank
 
Normal rank
Property / cites work
 
Property / cites work: Problems in between words and abelian words: \(k\)-abelian avoidability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequence entropy and the maximal pattern complexity of infinite words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Parikh mappings and homomorphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cube-free \(\omega\)-words generated by binary morphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abelian squares are avoidable on 4 letters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4341774 / rank
 
Normal rank
Property / cites work
 
Property / cites work: 5-Abelian cubes are avoidable on binary alphabets / rank
 
Normal rank
Property / cites work
 
Property / cites work: 3-Abelian Cubes Are Avoidable on Binary Alphabets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Repetitions in the Fibonacci infinite word / rank
 
Normal rank
Property / cites work
 
Property / cites work: A variant of a recursively unsolvable problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abelian returns in Sturmian words / 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: Abelian complexity of minimal subshifts / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of Sturmian sequences: Combinatorial structure and transcendence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3589628 / rank
 
Normal rank

Latest revision as of 04:21, 7 July 2024

scientific article
Language Label Description Also known as
English
On a generalization of abelian equivalence and complexity of infinite words
scientific article

    Statements

    On a generalization of abelian equivalence and complexity of infinite words (English)
    0 references
    0 references
    0 references
    0 references
    6 January 2014
    0 references
    abelian equivalence
    0 references
    complexity of words
    0 references
    Sturmian words
    0 references
    Szemerédi's theorem
    0 references
    0 references
    0 references

    Identifiers