Pages that link to "Item:Q2914707"
From MaRDI portal
The following pages link to Automatic Theorem-Proving in Combinatorics on Words (Q2914707):
Displaying 10 items.
- Deciding game invariance (Q515578) (← links)
- Asymptotic normality and strong consistency of maximum quasi-likelihood estimates in generalized linear models (Q854640) (← links)
- Some combinatorial properties of the Thue-Morse sequence and a problem in semigroups (Q1119694) (← links)
- Additive number theory via automata theory (Q1987517) (← links)
- Decision algorithms for Fibonacci-automatic Words, I: Basic results (Q3186674) (← links)
- A New Approach to the Paperfolding Sequences (Q3195678) (← links)
- Mechanical Proofs of Properties of the Tribonacci Word (Q3449367) (← links)
- On the Number of Unbordered Factors (Q4910467) (← links)
- ON THE NUMBER OF ABELIAN BORDERED WORDS (WITH AN EXAMPLE OF AUTOMATIC THEOREM-PROVING) (Q5247177) (← links)
- AUTOMATIC THEOREM-PROVING IN COMBINATORICS ON WORDS (Q5401556) (← links)