Characterizations of families of morphisms and words via binomial complexities (Q6201915): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Balances for fixed points of primitive substitutions. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of algebraic numbers. I: Expansions in integer bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Thue, combinatorics on words, and conjectures inspired by the Thue-Morse sequence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4330617 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4329174 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Thue-Morse sequence and p-adic topology for the free monoid / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3559177 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cyclic complexity of words / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of words of linear complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(k\)-abelian palindromes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On growth and fluctuation of \(k\)-abelian complexity / 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: Palindromes and Sturmian words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some unsolved problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abelian combinatorics on words: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconstructing Words from Right-Bounded-Block Words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some characterizations of Parikh matrix equivalent binary words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3836532 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructions of strictly ergodic systems / 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: On a generalization of abelian equivalence and complexity of infinite words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variations of the Morse-Hedlund Theorem for k-Abelian Equivalence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the \(k\)-binomial complexity of the Thue-Morse word / rank
 
Normal rank
Property / cites work
 
Property / cites work: Templates for the \(k\)-binomial complexity of the Tribonacci word / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Pascal triangle for binomial coefficients of words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4341774 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the 2-binomial complexity of the generalized Thue-Morse words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconstruction of sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introducing privileged words: privileged complexity of Sturmian words / rank
 
Normal rank
Property / cites work
 
Property / cites work: A noncommutative extension of Mahler's theorem on interpolation series / 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: On factorially balanced sets of words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relations on words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Another generalization of abelian equivalence: binomial complexity of infinite words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Binomial complexities and Parikh-collinear morphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automaticity and Parikh-Collinear Morphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3395979 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Logical Approach to Automatic Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equations over the \(k\)-binomial monoids / rank
 
Normal rank

Latest revision as of 17:03, 28 August 2024

scientific article; zbMATH DE number 7824157
Language Label Description Also known as
English
Characterizations of families of morphisms and words via binomial complexities
scientific article; zbMATH DE number 7824157

    Statements

    Characterizations of families of morphisms and words via binomial complexities (English)
    0 references
    0 references
    0 references
    0 references
    26 March 2024
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references