Automaticity and Parikh-Collinear Morphisms
From MaRDI portal
Publication:6134878
DOI10.1007/978-3-031-33180-0_19OpenAlexW4381303960MaRDI QIDQ6134878FDOQ6134878
Authors: Michel Rigo, Manon Stipulanti, Markus A. Whiteland 
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
Cites Work
- Power of words and recognizability of fixpoints of a substitution
- Automatic Sequences
- Uniform tag sequences
- Logic and \(p\)-recognizable sets of integers
- Some properties of substitutive words
- Asymptotic properties of free monoid morphisms
- The spectrum of dynamical systems arising from substitutions of constant length
- AVOIDING ABELIAN POWERS IN BINARY WORDS WITH BOUNDED ABELIAN COMPLEXITY
- Some unsolved problems
- Weak Second‐Order Arithmetic and Finite Automata
- Reconnaissabilité des substitutions et complexité des suites automatiques
- Abelian closures of infinite binary words
- Another generalization of abelian equivalence: binomial complexity of infinite words
- A new approach to the 2-regularity of the \(\ell\)-abelian complexity of 2-automatic sequences
- Enumeration and decidable properties of automatic sequences
- ON THE NUMBER OF ABELIAN BORDERED WORDS (WITH AN EXAMPLE OF AUTOMATIC THEOREM-PROVING)
- Formal Languages, Automata and Numeration Systems 2
- Automatic sequences are also non-uniformly morphic
- Abelian Complexity and Synchronization
- Abelian combinatorics on words: a survey
- Binomial complexities and Parikh-collinear morphisms
- On the boundary sequence of an automatic sequence
- The constant of recognizability is computable for primitive morphisms
- Hidden automatic sequences
- The Logical Approach to Automatic Sequences
Cited In (3)
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)
