An Order on Sets of Tilings Corresponding to an Order on Languages

Details An Order on Sets of Tilings Corresponding to an Order on Languages An Order on Sets of Tilings Corresponding to an Order on Languages

2009-02-10

arxiv.org/abs/0902.1602v1

26th International Symposium on Theoretical Aspects of Computer Science STACS 2009 (2009) 99-110

Computer Science

Discrete Mathematics

Scientific paper

Traditionally a tiling is defined with a finite number of finite forbidden patterns. We can generalize this notion considering any set of patterns. Generalized tilings defined in this way can be studied with a dynamical point of view, leading to the notion of subshift. In this article we establish a correspondence between an order on subshifts based on dynamical transformations on them and an order on languages of forbidden patterns based on computability properties.

Affiliated with

Also associated with

No associations

Rating

An Order on Sets of Tilings Corresponding to an Order on Languages does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with An Order on Sets of Tilings Corresponding to an Order on Languages, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An Order on Sets of Tilings Corresponding to an Order on Languages will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-19750