Pages that link to "Item:Q490407"
From MaRDI portal
The following pages link to Nondeterministic automatic complexity of overlap-free and almost square-free words (Q490407):
Displayed 8 items.
- Automatic complexity of shift register sequences (Q724846) (← links)
- On the complexity of automatic complexity (Q1694011) (← links)
- VC-dimensions of nondeterministic finite automata for words of equal length (Q2075374) (← links)
- Automatic complexity of Fibonacci and tribonacci words (Q2217496) (← links)
- Automatic Kolmogorov complexity, normality, and finite-state dimension revisited (Q2656172) (← links)
- The Complexity of Complexity (Q2973719) (← links)
- An incompressibility theorem for automatic complexity (Q5154787) (← links)
- Few Paths, Fewer Words: Model Selection With Automatic Structure Functions (Q5743090) (← links)