Analyzing Cellular Automata
|
|
- Gertrude Gaines
- 5 years ago
- Views:
Transcription
1 Analyzing Cellular Automata Klaus Sutner Carnegie Mellon University Pittsburgh, PA sutnerqcs.cmu.edu, Abstract We demonstrate automata, a Mathematica/C+i- hybrid system, that facilitates computation with finite state machines. In particular, we describe two applications of the system to the analysis of cellular automata. 1 The Applications We willfirstbriefly describe two applications of our package to the study of cellular automata, more detailed accounts can be found in the references. In both cases, extensive computational experiments were required to formulate appropriate conjectures. Mathematica is used as a general compute engine and also as a repository for data, text, and graphics. The external part of the package is specialized to perform computations on largefinitestate machines quickly. The combination of both components makes it easy to handle large scale computations in a clear and easily reproducible fashion. The ability to quickly generate and modify samples on demand also turned out to be very helpful in the construction of the actual proofs.
2 444 Innovation In Mathematics 1.1 Exponential Blow-Up The first application concerns the connection between linear cellular automata, or LCAs for short, and classical automata theory, in particular the theory of regular languages. More that a decade ago, S. Wolfram conducted exhaustive computational studies on LCAs. Part of the effort undertaken by Wolfram and his coworkers was an analysis of the minimal finite state machines associated with LCAs, see [12]. For the sake of this exposition, we can consider an LCA to be a continuous, shift-invariant map p : E» E on the space of all biinfinite words over some alphabet E. The map is represented by afinitedata structure of the form p : E» E. The finite subwords of all infinite words p(x) that occur after one time step form a regular language (p), and can therefore be described in terms of afinitestate machine. Typical examples of such languages are finite complement languages. Likewise, the subwords occurring after t steps in the evolution of a configuration can be recognized by a suitable finite state machine. A detailed table of the sizes of these machines can be found in the reference. Exploiting particular properties of these languages, one can show that they are accepted by a machine whose transition diagram is strongly connected, and whose states have distinct behavior. This machine is unique up to isomorphism and is referred to as the minimal Fischer automaton of the LCA. As it turns out, the minimal Fischer automaton is a subautomaton of the ordinary minimal automaton for (/?), and therefore the size of the former is bounded by the size of the latter. For the sake of simplicity we will confine ourselves to binary LCAs, i.e., automata with only two states 0 and 1. In this case, it is easy to see that the minimal automaton associated to an LCA p of width w has size at most 2^. Moreover, there are some examples of LCAs of width 3, 4 and 5 that actually reach this bound. As a matter of fact, the corresponding minimal Fischer automata have size 2^ 1, and differ from the minimal automata only in the absence of a sink state. On the other hand, if one iterates a LCA p of a given width u>, obtaining LCAs p* of width w(t) = t(w -1)4-1, it appears that the size of the minimal automata is significantly lower than the theoretical upper bound 2^. The question arises whether the complexity of the languages associated with the iterates p* of an LCA p can reach the upper bound for all or at least several values of, see also Problem 12 in [11]. We answer this question in the negative. In fact, we have the following theorem.
3 Innovation In Mathematics 445 Theorem 1.1 For every width w > 1 there is a binary LCA p of width w whose associated minimal finite state machine has size 2^. Deleting the sink from this automaton produces the minimal Fischer automaton. On the other hand, iterates p* cannot produce machines of this size. Lemma 1.1 Let p be a binary LCA. Then none of the iterates p*, t > 2, exhibits full exponential blow-up. Detailed proofs can be found in the forthcoming [5]. Is is conjectured there that the number of binary LCAs of width w that exhibit full exponential blow-up is actually 2 ~*2^~^, though we are currently able to account only for a few of these machines. 1.2 Binary Chebyshev Polynomials and a- Automata The LCAs that producefinitestate machines of maximal size from the last section are complicated in the sense that the patterns produced during the evolution of configurations are hard to describe in terms of classical finite state machines. At the other end of the spectrum lie additive cellular automata, such as the wellknown elementary CAs with rule numbers 90 and 150. Since the global maps are surjective (and even open) in this case, the corresponding minimal automaton has simply one state. However, the situation becomes more complicated when we try to understand the behavior of these automata on finite grids. Here we consider the generalization of rule 90 to be a binary 2-dimensional cellular automaton that determines the next state of a cell by adding the states of all four neighbors modulo 2. Likewise, rule 150 would generalize to an automaton where the summation includes the center cell. We refer to these automata as a and a+ automata, respectively. A good amount of information on these automata can be found in [1, 3, 7,, 2J. For example, the a-automaton on an n x m grid is reversible iff n + 1 and?7i -f 1 are coprime. Surprisingly, there are no comparable simple results for o~~^automata. As a matter of fact, the only characterization available at this point is the following. Consider a sequence of polynomials over the 2-element field F? defined by TTQ = 0 and where Un denotes the n-th Chebyshev polynomial of the second kind. A more helpful representation of the TT-polynomials is in terms of a second order homo-
4 446 Innovation In Mathematics geneous recurrence over ^[xj: = 1, For any polynomial p(x) in F^[x\ let p+(x) be the image of p under the involution x i > x + 1. Then we have Theorem 1.2 7%e cr+ -automaton over the n x m grid is reversible iff the polynomials 7ivJ+i(x) and7r,n+i(x) are coprime. It turns out that every irreducible polynomial over ^[x] occurs as a factor of some 7T</. Call the minimal such d the depth of the corresponding irreducible polynomial. The problems of determining the reversibility of the cr+ -automaton on an n x m grid are caused by the fact that the involution x» > x -f 1 changes the depth of an irreducible polynomial in an apparently very complicated fashion. 2 The automata System The results just mentioned deal with rather different aspects of cellular automata, and involve drastically different proof techniques-automata theory in the first case, and field theory in the second. They do share one important feature, though: both theorems would be difficult to conjecture, much less to prove, without a good amount of experimental computation. In the proper computational environment combination of experimental computation and abstract reasoning traces a path that leads to the theorems and their proofs. As a starting point to the theorem about Fischer automata, consider the sizes of the minimal automata associated with all 256 elementary CAs (binary linear CAs of width 3). The theoretical upper bound for the number of states is 16, and the lower bound is 1. size freq The interesting part here are the 16 machines of maximal complexity 2\ Using some general theory about machines recognizing so-called transitive factorial regular languages one is lead to study Fischer automata rather than the whole
5 Innovation In Mathematics 447 minimal automaton. In the case of the 16 machines from the picture, deleting the sink from the minimal machines produces the Fischer automaton. A more earful study of these Fischer automata shows that they are almost permutation automata: their transition relation very nearly induces a permutation of the state set for each input symbol. It is then natural to study almost-permutation automata for CAs of larger width. As it turns out, many of these automata exhibit drastic exponential blow-up during deterministic simulation. Here is an example. The following table shows the gaps A between the theoretical maximum complexity 2^ and the actual size of the power automaton associated with 192 automata that arise from binary LCAs of width 5. As one can see, half of the automata have maximum complexity, and most of the differences are powers of 2 and are due to certain forbidden subsets of the form QQ U pow(qi) in the power automaton. A freq. A freq Unfortunately, it appears to be difficult to account for all the machines with maximal size. For some of them, however, one can demonstrate that the blow-up does in fact occur, and that the resulting power automata are already reduced, i.e., isomophic to the minimial automaton. The Fischer automata consist of one giant strongly connected component that differs from the whole rutomaton only in that it does not contain the sink. The proof that blow-up occurs is a somewhat tedious argument using monoids of operations on the power set of the nondeterministic automaton that are induced by input sequences. In automata, it is not hard to construct these monoids and see how they act on the state set, and these computational experiments were very helpful in organizing the proof. For the second problem dealing with binary Chebyshev polynomials the ability to calculate conveniently with polynomials over F^ is exceedingly helpful. In particular the factorization algorithm was heavily used. Apart from dealing with the polynomials directly, it is also necessary to study the maps they induce on the pattern spaces associated with the additive CAs under consideration when various linear operators are substituted. Both domains can be handled with reasonable ease in Mathematica, Moreover, producing graphical images of the
6 44 Innovation In Mathematics patterns can be helpful to discover algebraic properties. The symmetry of certain patterns, for example, was crucial in finding a proof for certain periodicity properties of the binar Chebyshev polynomials. Once the analysis is under way, it is very helpful to be able to determine the depth of an irreducible polynomial r quickly, where by depth we mean the minimal n such that r divides TT^ (of course, an existence argument is required). The following table shows the position of some of the 30 irreducible polynomials r of degree as well as their images r+ relative to the TT-hierarchy. Needless to say, in hindsight it is not too hard to present computation-free proofs, arguments that hide the actual process of discovery and present purely abstract arguments. One might argue that at least for educational purposed the full, unexpurgated version is of greater value. Also, in the absence of computational support, the proofs could not be found without much greater effort on the side of the investigator. Modern media such as Mathematica notebooks that combine textual and graphical descriptions with executable code are ideally suited for this type of exposition. number image depth irreducible polynomial f 1-h x^ 4- x* -f x^ 4- x* In order to support experimental work of the type just described, the automata package has two components, implemented in Mathematica and C-f+, respectively. To a degree, both components can function independently of each other. For example, the external part of the package has a little compiler that parses and
7 Innovation In Mathematics 449 executes commands in a very specialized command language, custom designed for the manipulation of finite state machines and cellular automata. Typically, the stand alone code is used to cope with computations involving simple machine operations on a large set of input data. The data can be conveniently generated in Mathematica, written out tofile,processed off-line by the external code, and the results written to anotherfile.the output can than be read back into Mathematica and further analyzed there. All the external algorithms are also implemented internally in Mathematica. In fact, many of them werefirstproto-typed in Mathematica and then translated into fast C-H code. The external code is carefully tuned for speed (though currently not for memory consumption). For example, unsigned int type bit vectors are used for deterministic simulation for small machines, and for minimization Hopcroft's O(nlogn) algorithm is used. The two components interact via MathLink to produce an environment that combines most of the advantages of both approaches, while avoiding the obvious drawbacks. A more detailed description of the automata package can be found in the proceedings of IMS'95 (or rather, the appendix thereto), as well as in [9] and [10]. We will give a demonstration of the latest version of the package, and will show some of the crucial computations mentioned above in real time, on a laptop computer. The current version of the package is based on Mathematica 3.0. Unfortunately, we have not yet been able to take full advantage of all the new features in the system. In particular the much improved type-setting abilities are not yet fully incorporated. Neither is the new help system at the time of this writing. The improved compilation mechanism should be useful to speed up some of the internal code. Beyond these obvious adjustments, future developments will include facilities to cope with transducers rather than just acceptors, as is currently the case. Some more facilities for the analysis of the phase space of-reasonably smallfinite cellular automata will also be added in the next release. The semigroup related part of the package will be somewhat expanded, though Krohn-Rhodes decomposition will most likely remain an attractive but rather elusive target. Indeed, unlike with groups, semigroups have not been dealt with systematically in computer algebra, so a lot of groundwork needs to be done before one can think about implementing semigroups in any reasonable way.
8 450 Innovation In Mathematics Bibliography [1] B. Andrasfai. Cellular automata in trees. In Finite and Infinite Sets, volume 37, pages Colloquia Mathematica Societatis Janos Bolyai, Eger, Hungary, 191. [2] R. Barua and S. Ramakrishnan. cr-game, (7+ -game, and two-dimensional cellular automata. Theoretical Computer Science, 154(2) : , [3] O. Martin, A. M. Odlyzko, and S. Wolfram. Algebraic properties of cellular automata. Commun. Math. Phys., 93:219-25, 194. [4] J. E. Pin. Varieties of Formal Languages. Foundations of Computer Science. Plenum Publishing Corporation, 196. [5] K. Sutner. Linear cellular automata and Fischer automata. To appear in Parallel Computing. [6] K. Sutner. <j-automata and Chebyshev polynomials. Submitted to TCS. [7] K. Sutner. On cr-automata. Complex Systems, 2(l):l-2, 19. [] K. Sutner. Linear cellular automata and the Garden-of-Eden. Mathematical Intelligencer, ll(2):49-53, 199. [9] K. Sutner. Finite state machines and syntactic semigroups. The Mathemat- 2co JowrrW, 2(l):7-7, [10] K. Sutner. Implementing finite state machines. In N. Dean and G. Shannon, editors, Computational Support for Discrete Mathematics, volume 15, pages DIMACS, [11] S. Wolfram. Twenty problems in the theory of cellular automata. Physica #a, T9:170-13, 195. [12] S. Wolfram. Theory and Applications of Cellular Automata. World Scientific, 196.
Linear Cellular Automata and Fischer Automata
Linear Cellular Automata and Fischer Automata Klaus Sutner Carnegie Mellon University Pittsburgh, PA 523 sutner@cs.cmu.edu http://www.cs.cmu.edu/~sutner Abstract We study the sizes of minimal finite state
More informationFibonacci, Kronecker and Hilbert NKS Klaus Sutner Carnegie Mellon University sutner
Fibonacci, Kronecker and Hilbert NKS 2007 Klaus Sutner Carnegie Mellon University www.cs.cmu.edu/ sutner NKS 07 1 Overview Fibonacci, Kronecker and Hilbert??? Logic and Decidability Additive Cellular Automata
More informationOn Elementary and Algebraic Cellular Automata
Chapter On Elementary and Algebraic Cellular Automata Yuriy Gulak Center for Structures in Extreme Environments, Mechanical and Aerospace Engineering, Rutgers University, New Jersey ygulak@jove.rutgers.edu
More informationCDM Combinatorial Principles
CDM Combinatorial Principles 1 Counting Klaus Sutner Carnegie Mellon University Pigeon Hole 22-in-exclusion 2017/12/15 23:16 Inclusion/Exclusion Counting 3 Aside: Ranking and Unranking 4 Counting is arguably
More informationLinear Cellular Automata and Finite Automata
Linear Cellular Automata and Finite Automata Klaus Sutner Carnegie Mellon University Pittsburgh, PA 15213 sutner@cs.cmu.edu http://www.cs.cmu.edu/~sutner Abstract Linear cellular automata have a canonical
More informationThe Number of Non-Zero (mod k) Dominating Sets of Some Graphs
The Number of Non-Zero (mod k) Dominating Sets of Some Graphs Cheryl Jerozal The Pennsylvania State University University Park, PA, 16802 E-mail: pseudorandomcheryl@psu.edu William F. Klostermeyer Dept.
More information3515ICT: Theory of Computation. Regular languages
3515ICT: Theory of Computation Regular languages Notation and concepts concerning alphabets, strings and languages, and identification of languages with problems (H, 1.5). Regular expressions (H, 3.1,
More informationCDM. Recurrences and Fibonacci. 20-fibonacci 2017/12/15 23:16. Terminology 4. Recurrence Equations 3. Solution and Asymptotics 6.
CDM Recurrences and Fibonacci 1 Recurrence Equations Klaus Sutner Carnegie Mellon University Second Order 20-fibonacci 2017/12/15 23:16 The Fibonacci Monoid Recurrence Equations 3 Terminology 4 We can
More informationTakeaway Notes: Finite State Automata
Takeaway Notes: Finite State Automata Contents 1 Introduction 1 2 Basics and Ground Rules 2 2.1 Building Blocks.............................. 2 2.2 The Name of the Game.......................... 2 3 Deterministic
More informationTimo Latvala. March 7, 2004
Reactive Systems: Safety, Liveness, and Fairness Timo Latvala March 7, 2004 Reactive Systems: Safety, Liveness, and Fairness 14-1 Safety Safety properties are a very useful subclass of specifications.
More informationOn the skeleton of a finite transformation semigroup
Annales Mathematicae et Informaticae 37 (2010) pp. 77 84 http://ami.ektf.hu On the skeleton of a finite transformation semigroup Attila Egri-Nagy ab, Chrystopher L. Nehaniv b a Department of Computing
More informationTheory of Computing Tamás Herendi
Theory of Computing Tamás Herendi Theory of Computing Tamás Herendi Publication date 2014 Table of Contents 1 Preface 1 2 Formal languages 2 3 Order of growth rate 9 4 Turing machines 16 1 The definition
More information2. Syntactic Congruences and Monoids
IAS/PCMI Summer Session 2000 Clay Mathematics Undergraduate Program Advanced Course on Computational Complexity Lecture 3: Algebra and Languages David Mix Barrington and Alexis Maciel July 19, 2000 1.
More informationCDM. Recurrences and Fibonacci
CDM Recurrences and Fibonacci Klaus Sutner Carnegie Mellon University 20-fibonacci 2017/12/15 23:16 1 Recurrence Equations Second Order The Fibonacci Monoid Recurrence Equations 3 We can define a sequence
More informationWhat You Must Remember When Processing Data Words
What You Must Remember When Processing Data Words Michael Benedikt, Clemens Ley, and Gabriele Puppis Oxford University Computing Laboratory, Park Rd, Oxford OX13QD UK Abstract. We provide a Myhill-Nerode-like
More informationTHE GOLDEN MEAN SHIFT IS THE SET OF 3x + 1 ITINERARIES
THE GOLDEN MEAN SHIFT IS THE SET OF 3x + 1 ITINERARIES DAN-ADRIAN GERMAN Department of Computer Science, Indiana University, 150 S Woodlawn Ave, Bloomington, IN 47405-7104, USA E-mail: dgerman@csindianaedu
More informationChapter 1 Computer Arithmetic
Numerical Analysis (Math 9372) 2017-2016 Chapter 1 Computer Arithmetic 1.1 Introduction Numerical analysis is a way to solve mathematical problems by special procedures which use arithmetic operations
More informationUNIT-VIII COMPUTABILITY THEORY
CONTEXT SENSITIVE LANGUAGE UNIT-VIII COMPUTABILITY THEORY A Context Sensitive Grammar is a 4-tuple, G = (N, Σ P, S) where: N Set of non terminal symbols Σ Set of terminal symbols S Start symbol of the
More informationLecture Notes on Inductive Definitions
Lecture Notes on Inductive Definitions 15-312: Foundations of Programming Languages Frank Pfenning Lecture 2 September 2, 2004 These supplementary notes review the notion of an inductive definition and
More informationAn algebraic view of topological -machines
An algebraic view of topological -machines Luke Grecki Graduate Group in Applied Mathematics lgrecki@math.ucdavis.edu June 8, 2010 1 Contents 1 Semigroups 3 2 Semigroups of automata 4 3 -machine words
More informationFinite-state machines (FSMs)
Finite-state machines (FSMs) Dr. C. Constantinides Department of Computer Science and Software Engineering Concordia University Montreal, Canada January 10, 2017 1/19 Finite-state machines (FSMs) and state
More informationT (s, xa) = T (T (s, x), a). The language recognized by M, denoted L(M), is the set of strings accepted by M. That is,
Recall A deterministic finite automaton is a five-tuple where S is a finite set of states, M = (S, Σ, T, s 0, F ) Σ is an alphabet the input alphabet, T : S Σ S is the transition function, s 0 S is the
More informationConstructions on Finite Automata
Constructions on Finite Automata Informatics 2A: Lecture 4 Mary Cryan School of Informatics University of Edinburgh mcryan@inf.ed.ac.uk 24 September 2018 1 / 33 Determinization The subset construction
More informationImage Encryption and Decryption Algorithm Using Two Dimensional Cellular Automata Rules In Cryptography
Image Encryption and Decryption Algorithm Using Two Dimensional Cellular Automata Rules In Cryptography P. Sanoop Kumar Department of CSE, Gayatri Vidya Parishad College of Engineering(A), Madhurawada-530048,Visakhapatnam,
More informationDeterministic Finite Automata. Non deterministic finite automata. Non-Deterministic Finite Automata (NFA) Non-Deterministic Finite Automata (NFA)
Deterministic Finite Automata Non deterministic finite automata Automata we ve been dealing with have been deterministic For every state and every alphabet symbol there is exactly one move that the machine
More informationDynamics of finite linear cellular automata over Z N
Dynamics of finite linear cellular automata over Z N F. Mendivil, D. Patterson September 9, 2009 Abstract We investigate the behaviour of linear cellular automata with state space Z N and only finitely
More informationCS 154, Lecture 2: Finite Automata, Closure Properties Nondeterminism,
CS 54, Lecture 2: Finite Automata, Closure Properties Nondeterminism, Why so Many Models? Streaming Algorithms 0 42 Deterministic Finite Automata Anatomy of Deterministic Finite Automata transition: for
More informationAutomata Theory and Formal Grammars: Lecture 1
Automata Theory and Formal Grammars: Lecture 1 Sets, Languages, Logic Automata Theory and Formal Grammars: Lecture 1 p.1/72 Sets, Languages, Logic Today Course Overview Administrivia Sets Theory (Review?)
More informationCatalan numbers and power laws in cellular automaton rule 14
November 7, 2007 arxiv:0711.1338v1 [nlin.cg] 8 Nov 2007 Catalan numbers and power laws in cellular automaton rule 14 Henryk Fukś and Jeff Haroutunian Department of Mathematics Brock University St. Catharines,
More informationSlope Fields: Graphing Solutions Without the Solutions
8 Slope Fields: Graphing Solutions Without the Solutions Up to now, our efforts have been directed mainly towards finding formulas or equations describing solutions to given differential equations. Then,
More informationCOM364 Automata Theory Lecture Note 2 - Nondeterminism
COM364 Automata Theory Lecture Note 2 - Nondeterminism Kurtuluş Küllü March 2018 The FA we saw until now were deterministic FA (DFA) in the sense that for each state and input symbol there was exactly
More informationSymmetry Analysis of Discrete Dynamical Systems
Symmetry Analysis of Discrete Dynamical Systems Talk at CADE 2007, February 20-23, Turku, Finland Vladimir Kornyak Laboratory of Information Technologies Joint Institute for Nuclear Research February 23,
More informationChapter 2: Finite Automata
Chapter 2: Finite Automata 2.1 States, State Diagrams, and Transitions Finite automaton is the simplest acceptor or recognizer for language specification. It is also the simplest model of a computer. A
More informationGENERATING SETS AND DECOMPOSITIONS FOR IDEMPOTENT TREE LANGUAGES
Atlantic Electronic http://aejm.ca Journal of Mathematics http://aejm.ca/rema Volume 6, Number 1, Summer 2014 pp. 26-37 GENERATING SETS AND DECOMPOSITIONS FOR IDEMPOTENT TREE ANGUAGES MARK THOM AND SHEY
More informationAutomata Theory. Lecture on Discussion Course of CS120. Runzhe SJTU ACM CLASS
Automata Theory Lecture on Discussion Course of CS2 This Lecture is about Mathematical Models of Computation. Why Should I Care? - Ways of thinking. - Theory can drive practice. - Don t be an Instrumentalist.
More informationAutomata & languages. A primer on the Theory of Computation. Laurent Vanbever. ETH Zürich (D-ITET) September,
Automata & languages A primer on the Theory of Computation Laurent Vanbever www.vanbever.eu ETH Zürich (D-ITET) September, 24 2015 Last week was all about Deterministic Finite Automaton We saw three main
More informationObtaining the syntactic monoid via duality
Radboud University Nijmegen MLNL Groningen May 19th, 2011 Formal languages An alphabet is a non-empty finite set of symbols. If Σ is an alphabet, then Σ denotes the set of all words over Σ. The set Σ forms
More informationcse303 ELEMENTS OF THE THEORY OF COMPUTATION Professor Anita Wasilewska
cse303 ELEMENTS OF THE THEORY OF COMPUTATION Professor Anita Wasilewska LECTURE 1 Course Web Page www3.cs.stonybrook.edu/ cse303 The webpage contains: lectures notes slides; very detailed solutions to
More informationComputational Models - Lecture 4
Computational Models - Lecture 4 Regular languages: The Myhill-Nerode Theorem Context-free Grammars Chomsky Normal Form Pumping Lemma for context free languages Non context-free languages: Examples Push
More informationCDM Closure Properties
CDM Closure Properties Klaus Sutner Carnegie Mellon Universality 15-closure 2017/12/15 23:19 1 Nondeterministic Machines 2 Determinization 3 Closure Properties Where Are We? 3 We have a definition of regular
More informationSemigroup invariants of symbolic dynamical systems
Semigroup invariants of symbolic dynamical systems Alfredo Costa Centro de Matemática da Universidade de Coimbra Coimbra, October 6, 2010 Discretization Discretization Discretization 2 1 3 4 Discretization
More informationLecture Notes on Inductive Definitions
Lecture Notes on Inductive Definitions 15-312: Foundations of Programming Languages Frank Pfenning Lecture 2 August 28, 2003 These supplementary notes review the notion of an inductive definition and give
More informationConstructions on Finite Automata
Constructions on Finite Automata Informatics 2A: Lecture 4 Alex Simpson School of Informatics University of Edinburgh als@inf.ed.ac.uk 23rd September, 2014 1 / 29 1 Closure properties of regular languages
More informationDecomposition of Additive Cellular Automata
Decomposition of Additive Cellular Automata Klaus Sutner Carnegie Mellon University, Pittsburgh, PA 15213 Finite additive cellular automata with fixed and periodic boundary conditions are considered as
More informationCSC173 Workshop: 13 Sept. Notes
CSC173 Workshop: 13 Sept. Notes Frank Ferraro Department of Computer Science University of Rochester September 14, 2010 1 Regular Languages and Equivalent Forms A language can be thought of a set L of
More informationPrime Languages, Orna Kupferman, Jonathan Mosheiff. School of Engineering and Computer Science The Hebrew University, Jerusalem, Israel
Prime Languages, Orna Kupferman, Jonathan Mosheiff School of Engineering and Computer Science The Hebrew University, Jerusalem, Israel Abstract We say that a deterministic finite automaton (DFA) A is composite
More informationLights Out!: A Survey of Parity Domination in Grid Graphs
Lights Out!: A Survey of Parity Domination in Grid Graphs William Klostermeyer University of North Florida Jacksonville, FL 32224 E-mail: klostermeyer@hotmail.com Abstract A non-empty set of vertices is
More informationBridges for concatenation hierarchies
Bridges for concatenation hierarchies Jean-Éric Pin LIAFA, CNRS and Université Paris VII 2 Place Jussieu 75251 Paris Cedex O5, FRANCE e-mail: Jean-Eric.Pin@liafa.jussieu.fr Abstract. In the seventies,
More informationTheory of computation: initial remarks (Chapter 11)
Theory of computation: initial remarks (Chapter 11) For many purposes, computation is elegantly modeled with simple mathematical objects: Turing machines, finite automata, pushdown automata, and such.
More informationPushdown Automata. Chapter 12
Pushdown Automata Chapter 12 Recognizing Context-Free Languages We need a device similar to an FSM except that it needs more power. The insight: Precisely what it needs is a stack, which gives it an unlimited
More informationChapter 7 Turing Machines
Chapter 7 Turing Machines Copyright 2011 The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 A General Model of Computation Both finite automata and pushdown automata are
More informationTheory of Computation p.1/?? Theory of Computation p.2/?? Unknown: Implicitly a Boolean variable: true if a word is
Abstraction of Problems Data: abstracted as a word in a given alphabet. Σ: alphabet, a finite, non-empty set of symbols. Σ : all the words of finite length built up using Σ: Conditions: abstracted as a
More informationCMP 309: Automata Theory, Computability and Formal Languages. Adapted from the work of Andrej Bogdanov
CMP 309: Automata Theory, Computability and Formal Languages Adapted from the work of Andrej Bogdanov Course outline Introduction to Automata Theory Finite Automata Deterministic Finite state automata
More informationLecture 2: Connecting the Three Models
IAS/PCMI Summer Session 2000 Clay Mathematics Undergraduate Program Advanced Course on Computational Complexity Lecture 2: Connecting the Three Models David Mix Barrington and Alexis Maciel July 18, 2000
More informationA REPRESENTATION THEORETIC APPROACH TO SYNCHRONIZING AUTOMATA
A REPRESENTATION THEORETIC APPROACH TO SYNCHRONIZING AUTOMATA FREDRICK ARNOLD AND BENJAMIN STEINBERG Abstract. This paper is a first attempt to apply the techniques of representation theory to synchronizing
More informationIN this paper, we consider the capacity of sticky channels, a
72 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 54, NO. 1, JANUARY 2008 Capacity Bounds for Sticky Channels Michael Mitzenmacher, Member, IEEE Abstract The capacity of sticky channels, a subclass of insertion
More informationWords generated by cellular automata
Words generated by cellular automata Eric Rowland University of Waterloo (soon to be LaCIM) November 25, 2011 Eric Rowland (Waterloo) Words generated by cellular automata November 25, 2011 1 / 38 Outline
More informationCombinatorial Interpretations of a Generalization of the Genocchi Numbers
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 7 (2004), Article 04.3.6 Combinatorial Interpretations of a Generalization of the Genocchi Numbers Michael Domaratzki Jodrey School of Computer Science
More informationTHE MEASURE-THEORETIC ENTROPY OF LINEAR CELLULAR AUTOMATA WITH RESPECT TO A MARKOV MEASURE. 1. Introduction
THE MEASURE-THEORETIC ENTROPY OF LINEAR CELLULAR AUTOMATA WITH RESPECT TO A MARKOV MEASURE HASAN AKIN Abstract. The purpose of this short paper is to compute the measure-theoretic entropy of the onedimensional
More informationFinite-State Transducers
Finite-State Transducers - Seminar on Natural Language Processing - Michael Pradel July 6, 2007 Finite-state transducers play an important role in natural language processing. They provide a model for
More informationTuring Machines, diagonalization, the halting problem, reducibility
Notes on Computer Theory Last updated: September, 015 Turing Machines, diagonalization, the halting problem, reducibility 1 Turing Machines A Turing machine is a state machine, similar to the ones we have
More informationEquivalence of History and Generator ɛ-machines
MCS Codes: 37A50 37B10 60J10 Equivalence of History and Generator ɛ-machines Nicholas F. Travers 1, 2, 1, 2, 3, 4, and James P. Crutchfield 1 Complexity Sciences Center 2 Mathematics Department 3 Physics
More informationNumber Systems III MA1S1. Tristan McLoughlin. December 4, 2013
Number Systems III MA1S1 Tristan McLoughlin December 4, 2013 http://en.wikipedia.org/wiki/binary numeral system http://accu.org/index.php/articles/1558 http://www.binaryconvert.com http://en.wikipedia.org/wiki/ascii
More informationSome problems related to Singer sets
Some problems related to Singer sets Alex Chmelnitzki October 24, 2005 Preface The following article describes some of the work I did in the summer 2005 for Prof. Ben Green, Bristol University. The work
More informationω-automata Automata that accept (or reject) words of infinite length. Languages of infinite words appear:
ω-automata ω-automata Automata that accept (or reject) words of infinite length. Languages of infinite words appear: in verification, as encodings of non-terminating executions of a program. in arithmetic,
More informationLecture 3: Finite Automata
Administrivia Lecture 3: Finite Automata Everyone should now be registered electronically using the link on our webpage. If you haven t, do so today! I d like to have teams formed by next Monday at the
More informationA Note on the Reduction of Two-Way Automata to One-Way Automata
A Note on the Reduction of Two-Way Automata to One-Way Automata Moshe Y. Vardi IBM Almaden Research Center Abstract We describe a new elementary reduction of two-way automata to one-way automata. The reduction
More informationThe purpose here is to classify computational problems according to their complexity. For that purpose we need first to agree on a computational
1 The purpose here is to classify computational problems according to their complexity. For that purpose we need first to agree on a computational model. We'll remind you what a Turing machine is --- you
More informationTHE EHRENFEUCHT-MYCIELSKI SEQUENCE
THE EHRENFEUCHT-MYCIELSKI SEQUENCE K. SUTNER Abstract. We show that the Ehrenfeucht-Mycielsi sequence U is strongly balanced in the following sense: for any finite word w of length, the limiting frequency
More informationGRE Subject test preparation Spring 2016 Topic: Abstract Algebra, Linear Algebra, Number Theory.
GRE Subject test preparation Spring 2016 Topic: Abstract Algebra, Linear Algebra, Number Theory. Linear Algebra Standard matrix manipulation to compute the kernel, intersection of subspaces, column spaces,
More informationAperiodic languages and generalizations
Aperiodic languages and generalizations Lila Kari and Gabriel Thierrin Department of Mathematics University of Western Ontario London, Ontario, N6A 5B7 Canada June 18, 2010 Abstract For every integer k
More informationCISC 4090: Theory of Computation Chapter 1 Regular Languages. Section 1.1: Finite Automata. What is a computer? Finite automata
CISC 4090: Theory of Computation Chapter Regular Languages Xiaolan Zhang, adapted from slides by Prof. Werschulz Section.: Finite Automata Fordham University Department of Computer and Information Sciences
More information1 Introduction to information theory
1 Introduction to information theory 1.1 Introduction In this chapter we present some of the basic concepts of information theory. The situations we have in mind involve the exchange of information through
More informationIntroduction: Computer Science is a cluster of related scientific and engineering disciplines concerned with the study and application of computations. These disciplines range from the pure and basic scientific
More informationElliptic Curves Spring 2013 Lecture #8 03/05/2013
18.783 Elliptic Curves Spring 2013 Lecture #8 03/05/2013 8.1 Point counting We now consider the problem of determining the number of points on an elliptic curve E over a finite field F q. The most naïve
More informationWeek 2: Defining Computation
Computational Complexity Theory Summer HSSP 2018 Week 2: Defining Computation Dylan Hendrickson MIT Educational Studies Program 2.1 Turing Machines Turing machines provide a simple, clearly defined way
More informationStream Ciphers. Çetin Kaya Koç Winter / 20
Çetin Kaya Koç http://koclab.cs.ucsb.edu Winter 2016 1 / 20 Linear Congruential Generators A linear congruential generator produces a sequence of integers x i for i = 1,2,... starting with the given initial
More informationTuring machines and linear bounded automata
and linear bounded automata Informatics 2A: Lecture 29 John Longley School of Informatics University of Edinburgh jrl@inf.ed.ac.uk 27 November 2015 1 / 15 The Chomsky hierarchy: summary Level Language
More informationFormal Models in NLP
Formal Models in NLP Finite-State Automata Nina Seemann Universität Stuttgart Institut für Maschinelle Sprachverarbeitung Pfaffenwaldring 5b 70569 Stuttgart May 15, 2012 Nina Seemann (IMS) Formal Models
More information* 8 Groups, with Appendix containing Rings and Fields.
* 8 Groups, with Appendix containing Rings and Fields Binary Operations Definition We say that is a binary operation on a set S if, and only if, a, b, a b S Implicit in this definition is the idea that
More informationNowhere 0 mod p dominating sets in multigraphs
Nowhere 0 mod p dominating sets in multigraphs Raphael Yuster Department of Mathematics University of Haifa at Oranim Tivon 36006, Israel. e-mail: raphy@research.haifa.ac.il Abstract Let G be a graph with
More informationINF Introduction and Regular Languages. Daniel Lupp. 18th January University of Oslo. Department of Informatics. Universitetet i Oslo
INF28 1. Introduction and Regular Languages Daniel Lupp Universitetet i Oslo 18th January 218 Department of Informatics University of Oslo INF28 Lecture :: 18th January 1 / 33 Details on the Course consists
More informationA lower bound for scheduling of unit jobs with immediate decision on parallel machines
A lower bound for scheduling of unit jobs with immediate decision on parallel machines Tomáš Ebenlendr Jiří Sgall Abstract Consider scheduling of unit jobs with release times and deadlines on m identical
More informationUNIT-II. NONDETERMINISTIC FINITE AUTOMATA WITH ε TRANSITIONS: SIGNIFICANCE. Use of ε-transitions. s t a r t. ε r. e g u l a r
Syllabus R9 Regulation UNIT-II NONDETERMINISTIC FINITE AUTOMATA WITH ε TRANSITIONS: In the automata theory, a nondeterministic finite automaton (NFA) or nondeterministic finite state machine is a finite
More informationAutomata extended to nominal sets
Bachelor thesis Computer Science Radboud University Automata extended to nominal sets Author: Joep Veldhoven s4456556 First supervisor/assessor: Jurriaan Rot jrot@cs.ru.nl Second and third supervisor:
More informationLecture 4: Finite Automata
Administrivia Lecture 4: Finite Automata Everyone should now be registered electronically using the link on our webpage. If you haven t, do so today! I dliketohaveteamsformedbyfriday,ifpossible,butnextmonday
More informationComplexity and NP-completeness
Lecture 17 Complexity and NP-completeness Supplemental reading in CLRS: Chapter 34 As an engineer or computer scientist, it is important not only to be able to solve problems, but also to know which problems
More informationRepresenting Arithmetic Constraints with Finite Automata: An Overview
Representing Arithmetic Constraints with Finite Automata: An Overview Bernard Boigelot Pierre Wolper Université de Liège Motivation Linear numerical constraints are a very common and useful formalism (our
More informationNOTES ON AUTOMATA. Date: April 29,
NOTES ON AUTOMATA 1. Monoids acting on sets We say that a monoid S with identity element ɛ acts on a set Q if q(st) = (qs)t and qɛ = q. As with groups, if we set s = t whenever qs = qt for all q Q, then
More informationarxiv: v1 [cs.fl] 19 Mar 2015
Regular realizability problems and regular languages A. Rubtsov arxiv:1503.05879v1 [cs.fl] 19 Mar 2015 1 Moscow Institute of Physics and Technology 2 National Research University Higher School of Economics
More informationLecture 3: Finite Automata
Administrivia Lecture 3: Finite Automata Everyone should now be registered electronically using the link on our webpage. If you haven t, do so today! I d like to have teams formed by next Wednesday at
More informationAdvanced Automata Theory 11 Regular Languages and Learning Theory
Advanced Automata Theory 11 Regular Languages and Learning Theory Frank Stephan Department of Computer Science Department of Mathematics National University of Singapore fstephan@comp.nus.edu.sg Advanced
More informationRemarks on Separating Words
Remarks on Separating Words Erik D. Demaine, Sarah Eisenstat, Jeffrey Shallit 2, and David A. Wilson MIT Computer Science and Artificial Intelligence Laboratory, 32 Vassar Street, Cambridge, MA 239, USA,
More informationAn Algebraic Characterization of the Halting Probability
CDMTCS Research Report Series An Algebraic Characterization of the Halting Probability Gregory Chaitin IBM T. J. Watson Research Center, USA CDMTCS-305 April 2007 Centre for Discrete Mathematics and Theoretical
More informationRoger Levy Probabilistic Models in the Study of Language draft, October 2,
Roger Levy Probabilistic Models in the Study of Language draft, October 2, 2012 224 Chapter 10 Probabilistic Grammars 10.1 Outline HMMs PCFGs ptsgs and ptags Highlight: Zuidema et al., 2008, CogSci; Cohn
More informationLecture 14 - P v.s. NP 1
CME 305: Discrete Mathematics and Algorithms Instructor: Professor Aaron Sidford (sidford@stanford.edu) February 27, 2018 Lecture 14 - P v.s. NP 1 In this lecture we start Unit 3 on NP-hardness and approximation
More informationa = a i 2 i a = All such series are automatically convergent with respect to the standard norm, but note that this representation is not unique: i<0
p-adic Numbers K. Sutner v0.4 1 Modular Arithmetic rings integral domains integers gcd, extended Euclidean algorithm factorization modular numbers add Lemma 1.1 (Chinese Remainder Theorem) Let a b. Then
More informationDecision Problems Concerning. Prime Words and Languages of the
Decision Problems Concerning Prime Words and Languages of the PCP Marjo Lipponen Turku Centre for Computer Science TUCS Technical Report No 27 June 1996 ISBN 951-650-783-2 ISSN 1239-1891 Abstract This
More information1 Computational Problems
Stanford University CS254: Computational Complexity Handout 2 Luca Trevisan March 31, 2010 Last revised 4/29/2010 In this lecture we define NP, we state the P versus NP problem, we prove that its formulation
More informationArithmetical Hierarchy
Arithmetical Hierarchy 1 The Turing Jump Klaus Sutner Carnegie Mellon University Arithmetical Hierarchy 60-arith-hier 2017/12/15 23:18 Definability Formal Systems Recall: Oracles 3 The Use Principle 4
More information