Strong cocycle triviality for Z2 subshifts

Theoretical Computer Science

Volumn 262, Issue 1-2, 2001, Pages 191-213

  Jenkinson, Oliver ^a  

^a AIX MARSEILLE UNIVERSITÉ   (France)

Author keywords

Cocycle; Symbolic dynamics; Tilings; Two dimensional subshift

Indexed keywords

TRANSFER FUNCTIONS;

COCYCLE TRIVIALITY; SYMBOLIC DYNAMICS; TWO DIMENSIONAL SUBSHIFT;

COMPUTER SCIENCE;

EID: 0034916640     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(00)00189-4     Document Type: Article

References (25)

1. The undecidability of the domino problem
2. Nonuniqueness of measures of maximal entropy for subshifts of finite type
3. Double sequences with complexity mn + 1
4. Tilings and quasiperiodicity
5. A complete classification of two-point extensions of a multidimensional Bernoulli shift
6. A classification of the isometric extensions of a multidimensional Bernoulli shift
7. A classification of the finite extensions of a multidimensional Bernoulli shift
8. Periodic points, decidability, and Markov subgroups
9. Un champ Markovien peut être d'entropie nulle et mélangeant
10. Instances of cohomological triviality and rigidity
11. Group rings of polycyclic groups
12. The complexity of functions on lattices
13. Undecidability and nonperiodicity for tilings of the plane
14. The rectangle complexity of functions on two-dimensional lattices
15. The cohomology of higher-dimensional shifts of finite type
16. d actions
17. d-actions
18. Cominatoire des motifs d'une suite sturmienne bidimensionnelle
19. Proving theorems by pattern recognition II