Pages that link to "Item:Q1280222"
From MaRDI portal
The following pages link to Pascal's triangle, complexity and automata (Q1280222):
Displaying 17 items.
- Generalized Pascal triangle for binomial coefficients of words (Q308970) (← links)
- A realization of the Pascal automorphism in the concatenation graph and the sum-of-digits function \(s_2(n)\) (Q357294) (← links)
- On the joint subword complexity of automatic sequences (Q837149) (← links)
- On subword decomposition and balanced polynomials (Q868909) (← links)
- On some questions regarding \(k\)-regular and \(k\)-context-free sequences (Q930914) (← links)
- Asymptotic subword complexity of fixed points of group substitutions (Q1019186) (← links)
- The density of 0's in recurrence double sequences. (Q1415370) (← links)
- Symmetric patterns in the cellular automaton that generates Pascal's triangle modulo 2 (Q1582066) (← links)
- How to prove that a sequence is not automatic (Q2121041) (← links)
- On the subword complexity of Thue-Morse polynomial extractions (Q2465648) (← links)
- The distribution of elements in automatic double sequences (Q2566146) (← links)
- On digital sequences associated with Pascal's triangle (Q2696006) (← links)
- (Q3654095) (← links)
- Automaticity and Invariant Measures of Linear Cellular Automata (Q5138775) (← links)
- From Combinatorial Games to Shape-Symmetric Morphisms (Q5141334) (← links)
- Combinatorics of words and morphisms in some pieces of Tom Johnson (Q5207100) (← links)
- (Q5388997) (← links)
