Pages that link to "Item:Q4902892"
From MaRDI portal
The following pages link to ENUMERATION AND DECIDABLE PROPERTIES OF AUTOMATIC SEQUENCES (Q4902892):
Displayed 9 items.
- On the permutation complexity of the Cantor-like sequences (Q906402) (← links)
- A new approach to the 2-regularity of the \(\ell\)-abelian complexity of 2-automatic sequences (Q2256124) (← links)
- Computing abelian complexity of binary uniform morphic words (Q2629230) (← links)
- Closed, palindromic, rich, privileged, trapezoidal, and balanced words in automatic sequences (Q2635089) (← links)
- Decision algorithms for Fibonacci-automatic Words, I: Basic results (Q3186674) (← links)
- Effective S-adic Symbolic Dynamical Systems (Q3188236) (← links)
- A New Approach to the Paperfolding Sequences (Q3195678) (← links)
- Mechanical Proofs of Properties of the Tribonacci Word (Q3449367) (← links)
- ON THE NUMBER OF ABELIAN BORDERED WORDS (WITH AN EXAMPLE OF AUTOMATIC THEOREM-PROVING) (Q5247177) (← links)