Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

9

STACS
2009
Springer

favoriteEmaildiscussreport

66views Theoretical Computer Science» more STACS 2009»

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

13 years 9 months ago

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

Download hal.inria.fr

Abstract. Traditionally a tiling is deﬁned with a ﬁnite number of ﬁnite forbidden patterns. We can generalize this notion considering any set of patterns. Generalized tilings deﬁned 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.

Nathalie Aubrun, Mathieu Sablik

Real-time Traffic

Dynamical Point | STACS 2009 | ﬁnite Forbidden Patterns | ﬁnite Number |

claim paper

Related Content

» Subshifts Languages and Logic

» An Ordered Choice Logic Programming FrontEnd for Answer Set Solvers

» Tilings and model theory

» Intrinsic SecondOrder Geometric Optimization for Robust Point Set Registration without Cor...

» Implementing Ordered Choice Logic Programming using Answer Set Solvers

» Tilings as a programming exercise

» Monadic SecondOrder Logic for Graphs Algorithmic and Language Theoretical Applications

» Memory Consistency Conditions for SelfAssembly Programming

» Definability in Substructure Orderings II Finite Ordered Sets

Post Info
More Details (n/a)

Added	27 Jul 2010
Updated	27 Jul 2010
Type	Conference
Year	2009
Where	STACS
Authors	Nathalie Aubrun, Mathieu Sablik

Comments (0)