Pages that link to "Item:Q1747239"
From MaRDI portal
The following pages link to On the \(N\)th linear complexity of automatic sequences (Q1747239):
Displaying 13 items.
- A characterization of \(p\)-automatic sequences as columns of linear cellular automata (Q477771) (← links)
- Automatic complexity of shift register sequences (Q724846) (← links)
- On the joint subword complexity of automatic sequences (Q837149) (← links)
- Shift registers fool finite automata (Q1685924) (← links)
- Perfect linear complexity profile and apwenian sequences (Q1994979) (← links)
- Automated recurrence analysis for almost-linear expected-runtime bounds (Q2151240) (← links)
- Pseudorandom sequences derived from automatic sequences (Q2154881) (← links)
- On the \(N\)th maximum order complexity and the expansion complexity of a Rudin-Shapiro-like sequence (Q2202887) (← links)
- On the boundary sequence of an automatic sequence (Q2237216) (← links)
- (Q2712114) (← links)
- Minimum complexity of automatic non sturmian sequences (Q4858845) (← links)
- Decidability and Enumeration for Automatic Sequences: A Survey (Q4928472) (← links)
- Complexity of automatic sequences (Q5896135) (← links)