Pages that link to "Item:Q5401556"
From MaRDI portal
The following pages link to AUTOMATIC THEOREM-PROVING IN COMBINATORICS ON WORDS (Q5401556):
Displaying 11 items.
- Words with many palindrome pair factors (Q888638) (← links)
- Some combinatorial properties of the Thue-Morse sequence and a problem in semigroups (Q1119694) (← links)
- Factors of generalised polynomials and automatic sequences (Q1749026) (← links)
- How to prove that a sequence is not automatic (Q2121041) (← links)
- Asymptotic analysis of \(q\)-recursive sequences (Q2165029) (← links)
- Abelian-square-rich words (Q2358695) (← links)
- Automatic winning shifts (Q2672264) (← links)
- (Q4012525) (← links)
- First-Order Logic and Numeration Systems (Q4613547) (← links)
- Bracket words: A generalisation of Sturmian words arising from generalised polynomials (Q6112894) (← links)
- Decidability for Sturmian words (Q6597962) (← links)
