Automaticity and Parikh-Collinear Morphisms
From MaRDI portal
Publication:6134878
DOI10.1007/978-3-031-33180-0_19OpenAlexW4381303960MaRDI QIDQ6134878
Markus A. Whiteland, Manon Stipulanti, Michel Rigo
Publication date: 25 July 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-33180-0_19
Related Items (2)
On extended boundary sequences of morphic and Sturmian words ⋮ Characterizations of families of morphisms and words via binomial complexities
Cites Work
- Asymptotic properties of free monoid morphisms
- Another generalization of abelian equivalence: binomial complexity of infinite words
- Some unsolved problems
- Power of words and recognizability of fixpoints of a substitution
- Logic and \(p\)-recognizable sets of integers
- Some properties of substitutive words
- Binomial complexities and Parikh-collinear morphisms
- Automatic sequences are also non-uniformly morphic
- On the boundary sequence of an automatic sequence
- Abelian closures of infinite binary words
- A new approach to the 2-regularity of the \(\ell\)-abelian complexity of 2-automatic sequences
- The constant of recognizability is computable for primitive morphisms
- AVOIDING ABELIAN POWERS IN BINARY WORDS WITH BOUNDED ABELIAN COMPLEXITY
- Weak Second‐Order Arithmetic and Finite Automata
- The spectrum of dynamical systems arising from substitutions of constant length
- Automatic Sequences
- Reconnaissabilité des substitutions et complexité des suites automatiques
- ENUMERATION AND DECIDABLE PROPERTIES OF AUTOMATIC SEQUENCES
- Abelian Complexity and Synchronization
- Hidden automatic sequences
- The Logical Approach to Automatic Sequences
- ON THE NUMBER OF ABELIAN BORDERED WORDS (WITH AN EXAMPLE OF AUTOMATIC THEOREM-PROVING)
- Formal Languages, Automata and Numeration Systems 2
- Uniform tag sequences
- Abelian combinatorics on words: a survey
This page was built for publication: Automaticity and Parikh-Collinear Morphisms
