A Characterization of Subshifts with Computable Language

Abstract : Subshifts are sets of colorings of Z^d by a finite alphabet that avoid some family of forbidden patterns. We investigate here some analogies with group theory that were first noticed by the first author. In particular we prove several theorems on subshifts inspired by Higman's embedding theorems of group theory, among which, the fact that subshifts with a computable language can be obtained as restrictions of minimal subshifts of finite type.
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-02133469
Contributor : Pascal Vanier <>
Submitted on : Saturday, May 18, 2019 - 3:28:37 PM
Last modification on : Friday, October 4, 2019 - 1:12:43 AM

Identifiers

  • HAL Id : hal-02133469, version 1

Citation

Pascal Vanier, Emmanuel Jeandel. A Characterization of Subshifts with Computable Language. STACS 2019 - 36th International Symposium on Theoretical Aspects of Computer Science, Mar 2019, Berlin, Germany. ⟨hal-02133469⟩

Share

Metrics

Record views

24