Another generalization of abelian equivalence: binomial complexity of infinite words
From MaRDI portal
Publication:496049
DOI10.1016/J.TCS.2015.07.025zbMATH Open1330.68243OpenAlexW2468104078MaRDI QIDQ496049FDOQ496049
Authors: Michel Rigo, Pavel Salimov 
Publication date: 16 September 2015
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2015.07.025
Recommendations
- Another generalization of abelian equivalence: binomial complexity of infinite words
- On a generalization of abelian equivalence and complexity of infinite words
- The abelian complexity of infinite words and the Frobenius problem
- On abelian and additive complexity in infinite words
- Ultimately constant abelian complexity of infinite words
- Abelian complexity and frequencies of letters in infinite words
- Balances and Abelian complexity of a certain class of infinite ternary words
- Abelian complexity of infinite words associated with quadratic Parry numbers
- Abelian closures of infinite binary words
Thue-Morse wordSturmian wordabelian equivalencefactor complexityrecurrent wordbinomial equivalenceParikh-constant morphism
Factorials, binomial coefficients, combinatorial functions (05A10) Combinatorics on words (68R15) Binomial coefficients; factorials; (q)-identities (11B65)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A sharpening of the Parikh mapping
- Uniform tag sequences
- Subword histories and Parikh matrices
- Title not available (Why is that?)
- Substitutions in dynamics, arithmetics and combinatorics
- Balance and abelian complexity of the Tribonacci word
- Abelian complexity of minimal subshifts
- Complexity and special factors
- Thue-Morse sequence and p-adic topology for the free monoid
- Subword complexities of various classes of deterministic developmental languages without interactions
- Sequence entropy and the maximal pattern complexity of infinite words
- Enumeration of factors in the Thue-Morse word
- On a generalization of abelian equivalence and complexity of infinite words
- On the factors of the Thue-Morse word on three symbols
- Balances for fixed points of primitive substitutions.
- A limit theorem for set of subwords in deterministic TOL laguages
- Avoiding 2-binomial squares and cubes
- Another generalization of abelian equivalence: binomial complexity of infinite words
Cited In (35)
- Weighted prefix normal words: mind the gap
- Templates for the \(k\)-binomial complexity of the Tribonacci word
- On the additive complexity of a Thue-Morse-like sequence
- GAPS IN THE THUE–MORSE WORD
- Longest Common Subsequence with Gap Constraints
- Computing the \(k\)-binomial complexity of the Thue-Morse word
- Absent subsequences in words
- Title not available (Why is that?)
- Subsequences in bounded ranges: matching and analysis problems
- Reconstructing Words from Right-Bounded-Block Words
- Equations over the \(k\)-binomial monoids
- A compactness property of the \(k\)-abelian monoids
- Absent Subsequences in Words
- Matching patterns with variables under Simon's congruence
- Binomial complexities and Parikh-collinear morphisms
- Templates for the \(k\)-binomial complexity of the Tribonacci word
- Asymptotic abelian complexities of certain morphic binary words
- Characterizations of families of morphisms and words via binomial complexities
- The abelian complexity of infinite words and the Frobenius problem
- The binomial equivalence classes of finite words
- Scattered Factor-Universality of Words
- On \(k\)-abelian equivalence and generalized Lagrange spectra
- Combinatorial algorithms for subsequence matching: a survey
- Another generalization of abelian equivalence: binomial complexity of infinite words
- On the complexity functions of Sturmian words
- Reconstructing words from right-bounded-block words
- Relations on words
- Automatic abelian complexities of Parikh-collinear fixed points
- String attractors of some simple-parry automatic sequences
- On the number of distinct \(k\)-decks: enumeration and bounds
- Automaticity and Parikh-Collinear Morphisms
- On the 2-binomial complexity of the generalized Thue-Morse words
- Avoiding abelian powers cyclically
- On the Lie complexity of Sturmian words
- Abelian combinatorics on words: a survey
This page was built for publication: Another generalization of abelian equivalence: binomial complexity of infinite words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q496049)
