Decision algorithms for Fibonacci-automatic words. II: Related sequences and avoidability

DOI10.1016/j.tcs.2016.10.005zbMath1366.68223OpenAlexW2538425405MaRDI QIDQ346252

Luke Schaeffer, Hamoon Mousavi, Chen Fei Du, Eric S. Rowland, Jeffrey O. Shallit

Publication date: 5 December 2016

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2016.10.005

zbMATH Keywords

finite automatapalindromeautomatic sequencedecision procedureavoidability in wordsFibonacci representation

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45) Automata sequences (11B85) Other number representations (11A67)

Related Items (7)

Decision algorithms for Fibonacci-automatic Words, I: Basic results ⋮ Additive number theory via automata theory ⋮ Unnamed Item ⋮ Formulas with reversal ⋮ Unnamed Item ⋮ Sumsets of Wythoff sequences, Fibonacci representation, and beyond ⋮ Avoidability index for binary patterns with reversal

Uses Software

• Walnut

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the least number of palindromes contained in an infinite word
• On some generalizations of abelian power avoidability
• Two infinite families of polyominoes that tile the plane by translation in two distinct ways
• Growth rate of binary words avoiding \(xxx^{R}\)
• Avoiding squares and overlaps over the natural numbers
• Arithmetic progressions in lacunary sets
• A generalization of automatic sequences
• Sequences with subword complexity \(2n\)
• On uniformly repetitive semigroups
• Directed graphs and substitutions
• Pattern Avoidability with Involution
• COMPLEXITY OF THE FIBONACCI SNOWFLAKE
• UNARY PATTERNS WITH INVOLUTION
• Decision algorithms for Fibonacci-automatic Words, I: Basic results
• Avoiding Three Consecutive Blocks of the Same Size and Same Sum
• Systems of Numeration

This page was built for publication: Decision algorithms for Fibonacci-automatic words. II: Related sequences and avoidability