Automatic Theorem-Proving in Combinatorics on Words

DOI10.1007/978-3-642-31606-7_16zbMath1297.68215arXiv1203.3758OpenAlexW2087402722MaRDI QIDQ2914707

Daniel Goč, Dane Henshall, Jeffrey O. Shallit

Publication date: 20 September 2012

Published in: Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1203.3758

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45)

Related Items (8)

Mechanical Proofs of Properties of the Tribonacci Word ⋮ Decision algorithms for Fibonacci-automatic Words, I: Basic results ⋮ A New Approach to the Paperfolding Sequences ⋮ AUTOMATIC THEOREM-PROVING IN COMBINATORICS ON WORDS ⋮ Additive number theory via automata theory ⋮ On the Number of Unbordered Factors ⋮ Deciding game invariance ⋮ ON THE NUMBER OF ABELIAN BORDERED WORDS (WITH AN EXAMPLE OF AUTOMATIC THEOREM-PROVING)

Cites Work

• Unnamed Item
• Unnamed Item
• A proof of the extended Duval's conjecture
• Periodicity and unbordered segments of words
• Infinite 0-1 sequences without long adjacent identical blocks
• Relationship between the period of a finite word and the length of its unbordered segments
• Folds!
• Logic and \(p\)-recognizable sets of integers
• Biinfinite words with maximal recurrent unbordered factors.
• Inverse star, borders, and palstars
• Periodicity, repetitions, and orbits of an automatic sequence
• Unbordered factors and Lyndon words
• The Critical Exponent is Computable for Automatic Sequences
• Some Theorems on Fourier Coefficients
• Periodicity and unbordered words
• Least Periods of Factors of Infinite Words
• ON THE RELATION BETWEEN PERIODICITY AND UNBORDERED FACTORS OF FINITE WORDS
• A decision method for the recognizability of sets defined by number systems
• A note on bifix-free sequences (Corresp.)
• Automatic Sequences
• Enumeration and Decidable Properties of Automatic Sequences

This page was built for publication: Automatic Theorem-Proving in Combinatorics on Words