On extended boundary sequences of morphic and Sturmian words
From MaRDI portal
Publication:6117412
DOI10.37236/11728arXiv2206.15319OpenAlexW4391258612WikidataQ129303167 ScholiaQ129303167MaRDI QIDQ6117412
Manon Stipulanti, Michel Rigo, Markus A. Whiteland
Publication date: 19 February 2024
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2206.15319
Combinatorics on words (68R15) Automata sequences (11B85) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On a generalization of abelian equivalence and complexity of infinite words
- Relations on words
- Relationship between the period of a finite word and the length of its unbordered segments
- The characterization of \(N\)-écritures and applications to the study of sequences of finally \(n+c^{st}\) complexity
- Substitution invariant cutting sequences
- Logic and \(p\)-recognizable sets of integers
- Transcendence of numbers with a low complexity expansion
- On the sequentiality of the successor function
- Invariance properties of Sturmian words
- Bertrand numeration systems and recognizability
- Invertible substitutions and Sturmian sequences.
- Construction of regular languages and recognizability of polynomials
- Ostrowski numeration systems, addition, and finite automata
- Automatic sequences based on Parry or Bertrand numeration systems
- Regular sequences and synchronized sequences in abstract numeration systems
- Binomial complexities and Parikh-collinear morphisms
- Ostrowski-automatic sequences: theory and applications
- On the boundary sequence of an automatic sequence
- Some further results on squarefree arithmetic progressions in infinite words
- Syndeticity and independent substitutions
- On the abelian complexity of generalized Thue-Morse sequences
- Automatic winning shifts
- On a faithful representation of Sturmian morphisms
- Separating Regular Languages by Locally Testable and Locally Threshold Testable Languages
- Decision algorithms for Fibonacci-automatic Words, I: Basic results
- On $k$-abelian equivalence and generalized Lagrange spectra
- Initial powers of Sturmian sequences
- A Second Course in Formal Languages and Automata Theory
- Systems of Numeration
- On Periodic Expansions of Pisot Numbers and Salem Numbers
- Sequences with minimal block growth II
- Minimal symbolic flows having minimal block growth
- Automatic Sequences
- The on-line encyclopedia of integer sequences
- The Logical Approach to Automatic Sequences
- Formal Languages, Automata and Numeration Systems 2
- Uniform tag sequences
- Numeration systems on a regular language
- Numeration systems on a regular language: Arithmetic operations, recognizability and formal power series
- Automaticity and Parikh-Collinear Morphisms
- On the 2-binomial complexity of the generalized Thue-Morse words
This page was built for publication: On extended boundary sequences of morphic and Sturmian words
