Automatic abelian complexities of Parikh-collinear fixed points
From MaRDI portal
Cites work
- A characterization of substitutive sequences using return words
- Abelian combinatorics on words: a survey
- Abelian complexity and synchronization
- Another generalization of abelian equivalence: binomial complexity of infinite words
- Automatic Sequences
- Automatic sequences are also non-uniformly morphic
- Automaticity and Parikh-Collinear Morphisms
- AVOIDING ABELIAN POWERS IN BINARY WORDS WITH BOUNDED ABELIAN COMPLEXITY
- Characterizations of families of morphisms and words via binomial complexities
- Decidability of the HD0L ultimate periodicity problem
- Hidden automatic sequences
- scientific article; zbMATH DE number 2024859 (Why is no real title available?)
- Recognizability of morphisms
- Some unsolved problems
- Substitutional dynamical systems, Bratteli diagrams and dimension groups
- The constant of recognizability is computable for primitive morphisms
- The Logical Approach to Automatic Sequences
- The spectrum of dynamical systems arising from substitutions of constant length
- Weak Second‐Order Arithmetic and Finite Automata
This page was built for publication: Automatic abelian complexities of Parikh-collinear fixed points
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6661763)