1,664 research outputs found

    Advances and applications of automata on words and trees : abstracts collection

    Get PDF
    From 12.12.2010 to 17.12.2010, the Dagstuhl Seminar 10501 "Advances and Applications of Automata on Words and Trees" was held in Schloss Dagstuhl - Leibniz Center for Informatics. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available

    Turing degrees of limit sets of cellular automata

    Full text link
    Cellular automata are discrete dynamical systems and a model of computation. The limit set of a cellular automaton consists of the configurations having an infinite sequence of preimages. It is well known that these always contain a computable point and that any non-trivial property on them is undecidable. We go one step further in this article by giving a full characterization of the sets of Turing degrees of cellular automata: they are the same as the sets of Turing degrees of effectively closed sets containing a computable point

    Avalanches in the Weakly Driven Frenkel-Kontorova Model

    Full text link
    A damped chain of particles with harmonic nearest-neighbor interactions in a spatially periodic, piecewise harmonic potential (Frenkel-Kontorova model) is studied numerically. One end of the chain is pulled slowly which acts as a weak driving mechanism. The numerical study was performed in the limit of infinitely weak driving. The model exhibits avalanches starting at the pulled end of the chain. The dynamics of the avalanches and their size and strength distributions are studied in detail. The behavior depends on the value of the damping constant. For moderate values a erratic sequence of avalanches of all sizes occurs. The avalanche distributions are power-laws which is a key feature of self-organized criticality (SOC). It will be shown that the system selects a state where perturbations are just able to propagate through the whole system. For strong damping a regular behavior occurs where a sequence of states reappears periodically but shifted by an integer multiple of the period of the external potential. There is a broad transition regime between regular and irregular behavior, which is characterized by multistability between regular and irregular behavior. The avalanches are build up by sound waves and shock waves. Shock waves can turn their direction of propagation, or they can split into two pulses propagating in opposite directions leading to transient spatio-temporal chaos. PACS numbers: 05.70.Ln,05.50.+q,46.10.+zComment: 33 pages (RevTex), 15 Figures (available on request), appears in Phys. Rev.

    A Universal Semi-totalistic Cellular Automaton on Kite and Dart Penrose Tilings

    Full text link
    In this paper we investigate certain properties of semi-totalistic cellular automata (CA) on the well known quasi-periodic kite and dart two dimensional tiling of the plane presented by Roger Penrose. We show that, despite the irregularity of the underlying grid, it is possible to devise a semi-totalistic CA capable of simulating any boolean circuit on this aperiodic tiling.Comment: In Proceedings AUTOMATA&JAC 2012, arXiv:1208.249

    Proceedings of JAC 2010. Journées Automates Cellulaires

    Get PDF
    The second Symposium on Cellular Automata “Journ´ees Automates Cellulaires” (JAC 2010) took place in Turku, Finland, on December 15-17, 2010. The first two conference days were held in the Educarium building of the University of Turku, while the talks of the third day were given onboard passenger ferry boats in the beautiful Turku archipelago, along the route Turku–Mariehamn–Turku. The conference was organized by FUNDIM, the Fundamentals of Computing and Discrete Mathematics research center at the mathematics department of the University of Turku. The program of the conference included 17 submitted papers that were selected by the international program committee, based on three peer reviews of each paper. These papers form the core of these proceedings. I want to thank the members of the program committee and the external referees for the excellent work that have done in choosing the papers to be presented in the conference. In addition to the submitted papers, the program of JAC 2010 included four distinguished invited speakers: Michel Coornaert (Universit´e de Strasbourg, France), Bruno Durand (Universit´e de Provence, Marseille, France), Dora Giammarresi (Universit` a di Roma Tor Vergata, Italy) and Martin Kutrib (Universit¨at Gie_en, Germany). I sincerely thank the invited speakers for accepting our invitation to come and give a plenary talk in the conference. The invited talk by Bruno Durand was eventually given by his co-author Alexander Shen, and I thank him for accepting to make the presentation with a short notice. Abstracts or extended abstracts of the invited presentations appear in the first part of this volume. The program also included several informal presentations describing very recent developments and ongoing research projects. I wish to thank all the speakers for their contribution to the success of the symposium. I also would like to thank the sponsors and our collaborators: the Finnish Academy of Science and Letters, the French National Research Agency project EMC (ANR-09-BLAN-0164), Turku Centre for Computer Science, the University of Turku, and Centro Hotel. Finally, I sincerely thank the members of the local organizing committee for making the conference possible. These proceedings are published both in an electronic format and in print. The electronic proceedings are available on the electronic repository HAL, managed by several French research agencies. The printed version is published in the general publications series of TUCS, Turku Centre for Computer Science. We thank both HAL and TUCS for accepting to publish the proceedings.Siirretty Doriast

    Boolean Delay Equations: A simple way of looking at complex systems

    Full text link
    Boolean Delay Equations (BDEs) are semi-discrete dynamical models with Boolean-valued variables that evolve in continuous time. Systems of BDEs can be classified into conservative or dissipative, in a manner that parallels the classification of ordinary or partial differential equations. Solutions to certain conservative BDEs exhibit growth of complexity in time. They represent therewith metaphors for biological evolution or human history. Dissipative BDEs are structurally stable and exhibit multiple equilibria and limit cycles, as well as more complex, fractal solution sets, such as Devil's staircases and ``fractal sunbursts``. All known solutions of dissipative BDEs have stationary variance. BDE systems of this type, both free and forced, have been used as highly idealized models of climate change on interannual, interdecadal and paleoclimatic time scales. BDEs are also being used as flexible, highly efficient models of colliding cascades in earthquake modeling and prediction, as well as in genetics. In this paper we review the theory of systems of BDEs and illustrate their applications to climatic and solid earth problems. The former have used small systems of BDEs, while the latter have used large networks of BDEs. We moreover introduce BDEs with an infinite number of variables distributed in space (``partial BDEs``) and discuss connections with other types of dynamical systems, including cellular automata and Boolean networks. This research-and-review paper concludes with a set of open questions.Comment: Latex, 67 pages with 15 eps figures. Revised version, in particular the discussion on partial BDEs is updated and enlarge

    Conservation laws for strings in the Abelian Sandpile Model

    Full text link
    The Abelian Sandpile generates complex and beautiful patterns and seems to display allometry. On the plane, beyond patches, patterns periodic in both dimensions, we remark the presence of structures periodic in one dimension, that we call strings. We classify completely their constituents in terms of their principal periodic vector k, that we call momentum. We derive a simple relation between the momentum of a string and its density of particles, E, which is reminiscent of a dispersion relation, E=k^2. Strings interact: they can merge and split and within these processes momentum is conserved. We reveal the role of the modular group SL(2,Z) behind these laws.Comment: 4 pages, 4 figures in colo
    • …
    corecore