Pages that link to "Item:Q494068"
From MaRDI portal
The following pages link to Hardness of conjugacy, embedding and factorization of multidimensional subshifts (Q494068):
Displaying 6 items.
- Computational complexity of \(k\)-block conjugacy (Q2219057) (← links)
- Decidability of irreducible tree shifts of finite type (Q2283159) (← links)
- Hardness of conjugacy, embedding and factorization of multidimensional subshifts of finite type (Q2957910) (← links)
- Optimal state amalgamation is NP-hard (Q4968744) (← links)
- Parametrization by horizontal constraints in the study of algorithmic properties of \(\mathbb{Z}^2\)-subshifts of finite type (Q6041080) (← links)
- Arithmetical hierarchy of the Besicovitch-stability of noisy tilings (Q6185608) (← links)
