Finite state automata representing two-dimensional subshifts

DOI10.1016/J.TCS.2009.03.015zbMath1191.68389OpenAlexW2142255403MaRDI QIDQ840771

Joni B. Pirnot, Nataša Jonoska

Publication date: 14 September 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2009.03.015

zbMATH Keywords

periodicitytransitivitytwo-dimensional subshiftfollower set

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

On graph induced symbolic systems

Cites Work

• Unnamed Item
• Unnamed Item
• A small aperiodic set of Wang tiles
• Recognizable picture languages and domino tiling
• Automorphisms of compact groups
• Matrix Subshifts for Z ^v Symbolic Dynamics
• The decomposition theorem for two-dimensional shifts of finite type
• The symbolic dynamics of multidimensional tiling systems
• An Introduction to Symbolic Dynamics and Coding
• TRANSITIVITY IN TWO-DIMENSIONAL LOCAL LANGUAGES DEFINED BY DOT SYSTEMS
• The undecidability of the domino problem

This page was built for publication: Finite state automata representing two-dimensional subshifts