Machines, Computations, and Universality

In this talk we will survey several decidability and undecidability results on topological properties of self-affine or self-similar fractal tiles. Such tiles are obtained as fixed point of set equations governed by a graph. The study of their topological properties is known to be complex in general: we will illustrate this by undecidability results on tiles generated by multitape automata. In contrast, the class of self affine tiles called Rauzy fractals is particularly interesting. Such fractals provide geometrical representations of self-induced mathematical processes. They are associated to one-dimensional combinatorial substitutions (or iterated morphisms). They are somehow ubiquitous as self-replication processes appear naturally in several fields of mathematics. We will survey the main decidable topological properties of these specific Rauzy fractals and detail how the arithmetic properties of the substitution underlying the fractal construction make these properties decidable. We will end up this talk by discussing new questions arising in relation with continued fraction algorithm and fractal tiles generated by S-adic expansion systems. Concurrency, Histories, and Nets

[1]  Solomon Marcus,et al.  Contextual Grammars , 1969, COLING.

[2]  Azriel Rosenfeld,et al.  Picture languages—a survey , 1993 .

[3]  Grzegorz Rozenberg,et al.  Handbook of Formal Languages , 1997, Springer Berlin Heidelberg.

[4]  Matteo Pradella,et al.  A unifying approach to picture grammars , 2009, Inf. Comput..

[5]  Gheorghe Paun,et al.  Marcus Contextual Grammars , 1994, Bull. EATCS.

[6]  Benedek Nagy.  On a hierarchy of 5′ → 3′ sensing Watson-Crick finite automata languages , 2013, J. Log. Comput..

[7]  Takashi Yokomori,et al.  On the Computational Power of Insertion-Deletion Systems , 2002, DNA.

[8]  Gheorghe Paun,et al.  DNA Computing: New Computing Paradigms , 1998 .

[9]  Rudolf Freund,et al.  A General Framework for Regulated Rewriting Based on the Applicability of Rules , 2011, Computation, Cooperation, and Life.

[10]  Yuji Takada,et al.  A Hierarchy of Language Families Learnable by Regular Language Learning , 1995, Inf. Comput..

[11]  Rudolf Freund.  Control Mechanisms on #-Context-Free Array Grammars , 1994, Mathematical Aspects of Natural and Formal Languages.

[12]  Gheorghe Paun,et al.  Contextual Grammars and Formal Languages , 1997, Handbook of Formal Languages.

[13]  Sergey Verlan,et al.  On minimal context-free insertion-deletion systems , 2005, DCFS.

[14]  K. G. Subramanian,et al.  A note on regular-controlled apical-growth filamentous systems , 1985, International Journal of Computer & Information Sciences.

[15]  Antonio Restivo,et al.  Two-Dimensional Languages , 1997, Handbook of Formal Languages.

[16]  Ion Petre,et al.  Matrix insertion-deletion systems , 2010, Theor. Comput. Sci..

[17]  Rudolf Freund,et al.  Bounded Parallelism in Array Grammars Used for Character Recognition , 1996, SSPR.

[18]  Raghavan Rama,et al.  Array Contextual Grammars , 2000, Recent Topics in Mathematical and Computational Linguistics.

[19]  Henning Fernau,et al.  Even linear simple matrix languages: formal language properties and grammatical inference , 2002, Theor. Comput. Sci..

[20]  Arto Salomaa,et al.  Formal languages , 1973, Computer science classics.