Decision algorithms for Fibonacci-automatic words. I: Basic results.
From MaRDI portal
Recommendations
- Decision algorithms for Fibonacci-automatic words. III: Enumeration and abelian properties.
- Decision algorithms for Fibonacci-automatic words. II: Related sequences and avoidability
- scientific article; zbMATH DE number 36117
- Mechanical proofs of properties of the Tribonacci word
- scientific article; zbMATH DE number 3947643
Cites work
- A characterization of the squares in a Fibonacci string
- A combinatorial property of the Fibonacci words
- A generalization of automatic sequences
- Automatic Sequences
- Automatic Theorem-Proving in Combinatorics on Words
- Bertrand numeration systems and recognizability
- Certain words on the real projective line
- Collapse: A Fibonacci and Sturmian Game
- Decidability and Enumeration for Automatic Sequences: A Survey
- Decision algorithms for Fibonacci-automatic words. II: Related sequences and avoidability
- Decision algorithms for Fibonacci-automatic words. III: Enumeration and abelian properties.
- Efficient algorithms for Zeckendorf arithmetic
- Enumeration and decidable properties of automatic sequences
- Fibonacci numbers and words
- Fibonacci representations and finite automata
- scientific article; zbMATH DE number 1688349 (Why is no real title available?)
- scientific article; zbMATH DE number 5604127 (Why is no real title available?)
- scientific article; zbMATH DE number 410199 (Why is no real title available?)
- scientific article; zbMATH DE number 871172 (Why is no real title available?)
- scientific article; zbMATH DE number 891076 (Why is no real title available?)
- scientific article; zbMATH DE number 1390079 (Why is no real title available?)
- scientific article; zbMATH DE number 3267414 (Why is no real title available?)
- scientific article; zbMATH DE number 3397597 (Why is no real title available?)
- Least Periods of Factors of Infinite Words
- Linear numeration systems of order two
- Logic and p-recognizable sets of integers
- Lyndon words and Fibonacci numbers
- On cube-free \(\omega\)-words generated by binary morphisms
- On the completeness of a certain system of arithmetic of whole numbers in which addition occurs as the only operation
- On the number of frames in binary words
- On the number of unbordered factors
- Palindromes in the Fibonacci word
- Palindromic prefixes and episturmian words
- Periodicity, repetitions, and orbits of an automatic sequence
- Primitive words and Lyndon words in automatic and linearly recurrent sequences
- Quasiperiodicities in Fibonacci strings.
- Repetitions in the Fibonacci infinite word
- Representations of numbers and finite automata
- Self-generating sets, integers with missing blocks, and substitutions
- Suffix Conjugates for a Class of Morphic Subshifts
- Symbolic Dynamics II. Sturmian Trajectories
- Systems of Numeration
- The exact number of squares in Fibonacci words
- Uniform tag sequences
- Weak Second‐Order Arithmetic and Finite Automata
- Words and forbidden factors
Cited in
(44)- Infinite self-similar words
- Additive number theory via automata theory
- Subword complexity of the Fibonacci-Thue-Morse sequence: the proof of Dekking's conjecture
- Sumsets of Wythoff sequences, Fibonacci representation, and beyond
- Ostrowski-automatic sequences: theory and applications
- On prefix palindromic length of automatic words
- The numbers of repeated palindromes in the Fibonacci and Tribonacci words
- The number of valid factorizations of Fibonacci prefixes
- Critical exponents of infinite balanced words
- Automatic winning shifts
- Prefixes of the Fibonacci word that end with a cube
- The additive structure of integers with the lower Wythoff sequence
- Decision algorithms for Fibonacci-automatic words. III: Enumeration and abelian properties.
- Locally catenative sequences and turtle graphics
- Mechanical proofs of properties of the Tribonacci word
- Decision algorithms for Fibonacci-automatic words. II: Related sequences and avoidability
- scientific article; zbMATH DE number 3947643 (Why is no real title available?)
- scientific article; zbMATH DE number 36117 (Why is no real title available?)
- Subword occurrences, weighted automata and iterated morphisms, especially the Fibonacci morphism
- First-order logic and numeration systems
- Involutive Fibonacci words
- Deciding game invariance
- Infinite word factorization and signal flow graph
- scientific article; zbMATH DE number 7069796 (Why is no real title available?)
- Primitivity of atom Watson-Crick Fibonacci words
- Properties of a ternary infinite word
- Automatic sequences in negative bases and proofs of some conjectures of shevelev
- On extended boundary sequences of morphic and Sturmian words
- Note on a Fibonacci parity sequence
- An Inequality for the Number of Periods in a Word
- A Fibonacci analogue of the two’s complement numeration system
- A General Approach to Proving Properties of Fibonacci Representations via Automata Theory
- Decidability for Sturmian words
- Antisquares and critical exponents
- Using finite automata to compute the base-b representation of the golden ratio and other quadratic irrationals
- Computing the base-\(b\) representation of quadratic irrationals using automata
- Decidability of extensions of Presburger arithmetic by generalised polynomials
- Self-verifying predicates in Büchi arithmetic
- Automatic proofs in combinatorial game theory
- Automated reasoning for mathematics
- Prefixes of the Fibonacci word
- Beatty sequences for a quadratic irrational: decidability and applications
- Canonical Zeckendorf normalization and sharp iteration depth of the Berstel adder
- Complexity of linear subsequences of Fibonacci-automatic sequences
This page was built for publication: Decision algorithms for Fibonacci-automatic words. I: Basic results.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3186674)
