Mechanical proofs of properties of the Tribonacci word
From MaRDI portal
Publication:3449367
Abstract: We implement a decision procedure for answering questions about a class of infinite words that might be called (for lack of a better name) "Tribonacci-automatic". This class includes, for example, the famous Tribonacci word T = 0102010010202 ..., the fixed point of the morphism 0 -> 01, 1 -> 02, 2 -> 0. We use it to reprove some old results about the Tribonacci word from the literature, such as assertions about the occurrences in T of squares, cubes, palindromes, and so forth. We also obtain some new results.
Recommendations
- Decision algorithms for Fibonacci-automatic words. I: Basic results.
- Decision algorithms for Fibonacci-automatic words. III: Enumeration and abelian properties.
- Decision algorithms for Fibonacci-automatic words. II: Related sequences and avoidability
- The numbers of repeated palindromes in the Fibonacci and Tribonacci words
- The Tribonacci substitution
Cites work
- scientific article; zbMATH DE number 2152304 (Why is no real title available?)
- scientific article; zbMATH DE number 891076 (Why is no real title available?)
- scientific article; zbMATH DE number 3373767 (Why is no real title available?)
- A SAT attack on the Erdős discrepancy conjecture
- A morphic approach to combinatorial games: the Tribonacci case
- Abelian complexity function of the Tribonacci word
- Automatic Sequences
- Automatic Theorem-Proving in Combinatorics on Words
- Balance and abelian complexity of the Tribonacci word
- Bertrand numeration systems and recognizability
- Combinatorial, ergodic and arithmetic properties of the Tribonacci substitution
- Decidability and Enumeration for Automatic Sequences: A Survey
- Decision algorithms for Fibonacci-automatic words. III: Enumeration and abelian properties.
- Enumeration and decidable properties of automatic sequences
- Episturmian words and episturmian morphisms
- Episturmian words and some constructions of de Luca and Rauzy
- Episturmian words: a survey
- Formal proof
- Logic and \(p\)-recognizable sets of integers
- Noncommutative rational series with applications
- On Sturmian and episturmian words, and related topics
- On the completeness of a certain system of arithmetic of whole numbers in which addition occurs as the only operation
- On the number of unbordered factors
- Periodicity, repetitions, and orbits of an automatic sequence
- Powers in a class of \(\mathcal A\)-strict standard episturmian words
- Primitive words and Lyndon words in automatic and linearly recurrent sequences
- Quasiperiodic and Lyndon episturmian words
- Quasiperiodicities in Fibonacci strings.
- Representations of numbers and finite automata
- Some properties of the Tribonacci sequence
- Subword complexity and \(k\)-synchronization
- The Tribonacci substitution
- Uniform tag sequences
Cited in
(13)- Abelian complexity and synchronization
- Ostrowski-automatic sequences: theory and applications
- Abelian complexity function of the Tribonacci word
- The numbers of repeated palindromes in the Fibonacci and Tribonacci words
- Queens in exile: non-attacking queens on infinite chess boards
- Decision algorithms for Fibonacci-automatic words. I: Basic results.
- scientific article; zbMATH DE number 2152304 (Why is no real title available?)
- First-order logic and numeration systems
- Prefixes of the Fibonacci word that end with a cube
- Deciding game invariance
- Decision algorithms for Fibonacci-automatic words. III: Enumeration and abelian properties.
- Some tribonacci conjectures
- Lie complexity of words
This page was built for publication: Mechanical proofs of properties of the Tribonacci word
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3449367)
