Pages that link to "Item:Q1340682"
From MaRDI portal
The following pages link to Automata calculating the complexity of automatic sequences (Q1340682):
Displaying 14 items.
- Subword complexity of uniform D0L words over finite groups (Q719314) (← links)
- Behavior of various complexity functions (Q764361) (← links)
- On the context-freeness of the set of words containing overlaps (Q845966) (← links)
- Asymptotic subword complexity of fixed points of group substitutions (Q1019186) (← links)
- Some combinatorial properties of the Thue-Morse sequence and a problem in semigroups (Q1119694) (← links)
- The ring of \(k\)-regular sequences (Q1193879) (← links)
- Complexity and special factors (Q1280227) (← links)
- Complexity of generalized Rudin-Shapiro sequences (Q1320516) (← links)
- Automata calculating the complexity of automatic sequences (Q1340682) (← links)
- Separators in infinite words generated by morphisms. (Q1390860) (← links)
- Special factors of automatic sequences (Q1917395) (← links)
- On the D0L Repetition Threshold (Q3060199) (← links)
- Minimum complexity of automatic non sturmian sequences (Q4858845) (← links)
- The subword complexity of fixed points of binary uniform morphisms (Q5055933) (← links)
