Automaticity and Parikh-Collinear Morphisms
From MaRDI portal
Cites work
- A new approach to the 2-regularity of the \(\ell\)-abelian complexity of 2-automatic sequences
- AVOIDING ABELIAN POWERS IN BINARY WORDS WITH BOUNDED ABELIAN COMPLEXITY
- Abelian closures of infinite binary words
- Abelian combinatorics on words: a survey
- Abelian complexity and synchronization
- Another generalization of abelian equivalence: binomial complexity of infinite words
- Asymptotic properties of free monoid morphisms
- Automatic Sequences
- Automatic sequences are also non-uniformly morphic
- Binomial complexities and Parikh-collinear morphisms
- Enumeration and decidable properties of automatic sequences
- Formal languages, automata and numeration systems. Vol. 2. Applications to recognizability and decidability
- Hidden automatic sequences
- Logic and p-recognizable sets of integers
- On the boundary sequence of an automatic sequence
- On the number of abelian bordered words (with an example of automatic theorem-proving)
- Power of words and recognizability of fixpoints of a substitution
- Reconnaissabilité des substitutions et complexité des suites automatiques
- Some properties of substitutive words
- Some unsolved problems
- The Logical Approach to Automatic Sequences
- The constant of recognizability is computable for primitive morphisms
- The spectrum of dynamical systems arising from substitutions of constant length
- Uniform tag sequences
- Weak Second‐Order Arithmetic and Finite Automata
Cited in
(5)- Computing the k-binomial complexity of generalized Thue-Morse words
- Characterizations of families of morphisms and words via binomial complexities
- Additive word complexity and \texttt{Walnut}
- Automatic abelian complexities of Parikh-collinear fixed points
- On extended boundary sequences of morphic and Sturmian words
This page was built for publication: Automaticity and Parikh-Collinear Morphisms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6134878)
