AUTOMATIC THEOREM-PROVING IN COMBINATORICS ON WORDS
From MaRDI portal
Publication:5401556
DOI10.1142/S0129054113400182zbMath1304.68143MaRDI QIDQ5401556
Dane Henshall, Daniel Goč, Jeffrey O. Shallit
Publication date: 10 March 2014
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
enumerationdecidabilitylinear recurrenceautomatic sequencesfinite automataperiodscombinatorics on wordsbordersautomatic theorem-proving
Combinatorics on words (68R15) Permutations, words, matrices (05A05) Formal languages and automata (68Q45) Automata sequences (11B85) Software, source code, etc. for problems pertaining to computer science (68-04)
Related Items (7)
Abelian-square-rich words ⋮ How to prove that a sequence is not automatic ⋮ Asymptotic analysis of \(q\)-recursive sequences ⋮ Automatic winning shifts ⋮ Words with many palindrome pair factors ⋮ Bracket words: A generalisation of Sturmian words arising from generalised polynomials ⋮ First-Order Logic and Numeration Systems
Cites Work
- On factors of synchronized sequences
- 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!
- 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
- Automatic Theorem-Proving in Combinatorics on Words
- On synchronized sequences and their separators
- 2726. A problem on strings of beads
- Periodicity and unbordered words
- Least Periods of Factors of Infinite Words
- ON THE RELATION BETWEEN PERIODICITY AND UNBORDERED FACTORS OF FINITE WORDS
- ON THE REPETITIVITY INDEX OF INFINITE WORDS
- A decision method for the recognizability of sets defined by number systems
- A note on bifix-free sequences (Corresp.)
This page was built for publication: AUTOMATIC THEOREM-PROVING IN COMBINATORICS ON WORDS
