Author:
JEANDEL EMMANUEL,VANIER PASCAL
Abstract
AbstractWe show that the sets of periods of multi-dimensional shifts of finite type are precisely the sets of integers of the complexity classNP. We also show that the functions counting their number are the functions of #P. We also give characterizations of some other notions of periodicity in terms of space complexity. We finish the paper by giving some characterizations for sofic and effective subshifts.
Publisher
Cambridge University Press (CUP)
Subject
Applied Mathematics,General Mathematics
Reference31 articles.
1. Über die gegenseitige Lage gleicher Teiler gewisser Zeichenreihen;Thue;Kra. Vidensk. Selsk. Skrifter. I. Mat.-Nat. Kl.,1912
2. The method of forcing for nondeterministic automata;Szelepcsényi;Bull. EATCS,1987
3. Medvedev degrees of 2-dimensional subshifts of finite type;Simpson;Ergod. Th. and Dynam. Sys.,2012
4. Undecidability and nonperiodicity for tilings of the plane
Cited by
32 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献