Mechanical Proofs of Properties of the Tribonacci Word
From MaRDI portal
Publication:3449367
DOI10.1007/978-3-319-23660-5_15zbMath1350.68218arXiv1407.5841OpenAlexW2963056426MaRDI QIDQ3449367
Hamoon Mousavi, Jeffrey O. Shallit
Publication date: 4 November 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1407.5841
Combinatorics on words (68R15) Decidability of theories and sets of sentences (03B25) Mechanization of proofs and logical operations (03B35) Automata sequences (11B85)
Related Items (7)
Abelian Complexity and Synchronization ⋮ Lie complexity of words ⋮ The numbers of repeated palindromes in the Fibonacci and Tribonacci words ⋮ First-Order Logic and Numeration Systems ⋮ Ostrowski-automatic sequences: theory and applications ⋮ Deciding game invariance ⋮ Queens in exile: non-attacking queens on infinite chess boards
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Balance and abelian complexity of the Tribonacci word
- Logic and \(p\)-recognizable sets of integers
- Bertrand numeration systems and recognizability
- Episturmian words and episturmian morphisms
- Combinatorial, ergodic and arithmetic properties of the Tribonacci substitution
- Periodicity, repetitions, and orbits of an automatic sequence
- Some properties of the Tribonacci sequence
- Powers in a class of \(\mathcal A\)-strict standard episturmian words
- Quasiperiodic and Lyndon episturmian words
- Automatic Theorem-Proving in Combinatorics on Words
- Decision Algorithms for Fibonacci-Automatic Words, III: Enumeration and Abelian Properties
- A SAT Attack on the Erdős Discrepancy Conjecture
- A morphic approach to combinatorial games: the Tribonacci case
- On the completeness of a certain system of arithmetic of whole numbers in which addition occurs as the only operation
- Representations of numbers and finite automata
- Automatic Sequences
- ENUMERATION AND DECIDABLE PROPERTIES OF AUTOMATIC SEQUENCES
- On the Number of Unbordered Factors
- Primitive Words and Lyndon Words in Automatic and Linearly Recurrent Sequences
- Decidability and Enumeration for Automatic Sequences: A Survey
- Abelian complexity function of the Tribonacci word
- Subword Complexity and k-Synchronization
- Episturmian words: a survey
- On Sturmian and episturmian words, and related topics
- Uniform tag sequences
- Episturmian words and some constructions of de Luca and Rauzy
This page was built for publication: Mechanical Proofs of Properties of the Tribonacci Word
