Pages that link to "Item:Q2789533"
From MaRDI portal
The following pages link to The critical exponent is computable for automatic sequences (Q2789533):
Displaying 16 items.
- Topological conjugacy of constant length substitution dynamical systems (Q505048) (← links)
- Quadratic approximation to automatic continued fractions (Q888180) (← links)
- On balanced sequences and their critical exponent (Q2098168) (← links)
- The upper density of an automatic set is rational (Q2211032) (← links)
- Ostrowski-automatic sequences: theory and applications (Q2222098) (← links)
- Periodicity, repetitions, and orbits of an automatic sequence (Q2271417) (← links)
- Critical exponent of infinite balanced words via the Pell number system (Q2333033) (← links)
- On square factors and critical factors of \(k\)-bonacci words on infinite alphabet (Q2661776) (← links)
- The critical exponent is computable for automatic sequences (Q2789533) (← links)
- (Q2841972) (redirect page) (← links)
- Automatic Theorem-Proving in Combinatorics on Words (Q2914707) (← links)
- Automatic Sets of Rational Numbers (Q2947958) (← links)
- Decision algorithms for Fibonacci-automatic Words, I: Basic results (Q3186674) (← links)
- Frobenius Numbers and Automatic Sequences (Q3390106) (← links)
- First-Order Logic and Numeration Systems (Q4613547) (← links)
- String attractors of some simple-parry automatic sequences (Q6661762) (← links)
