Pages that link to "Item:Q5449816"
From MaRDI portal
The following pages link to Forbidden Substrings, Kolmogorov Complexity and Almost Periodic Sequences (Q5449816):
Displayed 13 items.
- Fixed-point tile sets and their applications (Q439933) (← links)
- \(\mu\)-limit sets of cellular automata from a computational complexity perspective (Q494067) (← links)
- Seas of squares with sizes from a \(\Pi_{1}^{0}\) set (Q1686319) (← links)
- Compressibility and probabilistic proofs (Q2011640) (← links)
- Resource-bounded Kolmogorov complexity provides an obstacle to soficness of multidimensional shifts (Q2136854) (← links)
- Kolmogorov Complexity as a Language (Q3007621) (← links)
- Computability in Symbolic Dynamics (Q3188248) (← links)
- Effective Closed Subshifts in 1D Can Be Implemented in 2D (Q3586005) (← links)
- Asymptotic Cellular Complexity (Q3637225) (← links)
- The expressiveness of quasiperiodic and minimal shifts of finite type (Q4964767) (← links)
- On the Expressive Power of Quasiperiodic SFT. (Q5111219) (← links)
- Shift-complex sequences (Q5300087) (← links)
- Two notes on subshifts (Q5390213) (← links)