Recurring dominoes: making the highly undecidable highly understandable
Selected papers of the international conference on "foundations of computation theory" on Topics in the theory of computation
On logics, tilings, and automata
Proceedings of the 18th international colloquium on Automata, languages and programming
Theoretical Computer Science
Monadic second-order logic over rectangular pictures and recognizability by tiling systems
Information and Computation
An introduction to symbolic dynamics and coding
An introduction to symbolic dynamics and coding
Handbook of formal languages, vol. 3
Languages, automata, and logic
Handbook of formal languages, vol. 3
Elements Of Finite Model Theory (Texts in Theoretical Computer Science. An Eatcs Series)
Elements Of Finite Model Theory (Texts in Theoretical Computer Science. An Eatcs Series)
Framed Versus Unframed Two-Dimensional Languages
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Subshifts, Languages and Logic
DLT '09 Proceedings of the 13th International Conference on Developments in Language Theory
Tiling systems over infinite pictures and their acceptance conditions
DLT'02 Proceedings of the 6th international conference on Developments in language theory
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
On factor universality in symbolic spaces
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Strong Fault-Tolerance for Self-Assembly with Fuzzy Temperature
FOCS '10 Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science
Rice's theorem for µ-limit sets of cellular automata
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
| Hi-index | 0.00 |
We study the Monadic Second Order (MSO) Hierarchy over colorings of the discrete plane, and draw links between classes of formula and classes of subshifts. We give a characterization of existential MSO in terms of projections of tilings, and of universal sentences in terms of combinations of ''pattern counting'' subshifts. Conversely, we characterize logic fragments corresponding to various classes of subshifts (subshifts of finite type, sofic subshifts, all subshifts). Finally, we show by a separation result how the situation here is different from the case of tiling pictures studied earlier by Giammarresi et al.