Critical exponent of infinite balanced words via the Pell number system
From MaRDI portal
Publication:2333033
DOI10.1007/978-3-030-28796-2_6zbMath1447.68009arXiv1902.00503OpenAlexW3100315250MaRDI QIDQ2333033
Aseem Baranwal, Jeffrey O. Shallit
Publication date: 6 November 2019
Full work available at URL: https://arxiv.org/abs/1902.00503
Combinatorics on words (68R15) Automata and formal grammars in connection with logical questions (03D05) Mechanization of proofs and logical operations (03B35) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)
Related Items (10)
Computation of critical exponent in balanced sequences ⋮ On minimal critical exponent of balanced sequences ⋮ Complementary symmetric Rote sequences: the critical exponent and the recurrence function ⋮ An upper bound on asymptotic repetition threshold of balanced sequences via colouring of the Fibonacci sequence ⋮ Ostrowski-automatic sequences: theory and applications ⋮ On balanced sequences and their asymptotic critical exponent ⋮ The repetition threshold for binary rich words ⋮ Regular sequences and synchronized sequences in abstract numeration systems ⋮ On balanced sequences and their critical exponent ⋮ Asymptotic repetitive threshold of balanced sequences
Uses Software
This page was built for publication: Critical exponent of infinite balanced words via the Pell number system
