Physarum Syllogistic L-Systems
|
|
- Tracy Nathan Moody
- 5 years ago
- Views:
Transcription
1 Physarum Syllogistic L-Systems Andrew Schumann University of Information Technology and Management Rzeszow, Poland Abstract One of the best media for studying natural computing is presented by the behavior of Physarum Polycephalum plasmodia. Plasmodium has active zones of growing pseudopodia and these zones interact concurrently and in a parallel manner. This behavior can be stimulated by attractants and repellents. In the paper, different syllogistic systems are proposed for simulating the plasmodium s behavior. While Aristotelian syllogistic may describe concrete directions of Physarum spatial expansions, pragmatic syllogistic proposed in this paper may describe Physarum simultaneous propagations in all directions. It is a more suitable system for applying syllogistic models in designing logic gates in plasmodia. Keywords-plasmodium; L-system; Aristotelian syllogistics; non-aristotelian syllogistics. I. INTRODUCTION There are many approaches to biological computing as a kind of unconventional computing; one of them is presented by systems invented by Aristid Lindenmayer [4]. They are called L-systems and allow us to simulate the growth of plants by formal grammars [6][13]. In the project [2], we are going to develop another approach to biological computing, assuming a massive parallelism of biological behavior. In this paper, we will show that we can implement two syllogistics in the biological behavior: the Aristotelian syllogistic [5] and a non-aristotelian syllogistic constructed in [10][12]. The first is implementable within standard trees of appropriate L-systems. The second is massive-parallel and contain cycles and, therefore, can be implementable just within non-standard trees of some rigorous extensions of L- systems. This means that Physarum Polycephalum, the medium of computations, which we have studied in the project, embodies complex extensions of L-systems. Let us recall that Physarum Polycephalum is a one-cell organism that behaves according to different stimuli and can be considered the basic medium of simple actions that are intelligent in the human meaning [1][2][7][8][9]. It behaves by plasmodia which can have the form either waves or protoplasmic tubes (arches). Hence, it is a system that is being spatially extended, as well as standard L-systems. This extension can be described as an extension of L-system called Physarum L-system (Section 2). Within this system we can implement (i) Aristotelian syllogistic in the Physarum media (Section 4), as well as non-aristotelian syllogistic defined in [10][12] (Section 5). In our project [2], we obtained a basis of new objectoriented programming language for Physarum polycephalum computing [11]. Within this language we are going to check possibilities of practical implementations of storage modification machines on plasmodia and their applications to behavioral science such as behavioral economics and game theory. The point is that experiments with plasmodia may show fundamental properties of any intelligent behavior. The language, proposed by us, can be used for developing programs for Physarum Polycephalum by the spatial configuration of stationary nodes. Some preliminary results of computational models on plasmodia are obtained in [1]. In this paper, we consider possibilities to implement syllogistic models as logic gates for Physarum Polycephalum, which can be programmable within our language. In Section 2, we define Physarum L-systems. In Section 3, we consider their particular case presented by Aristotelian trees. In Section 4, we show how we can implement Aristotelian syllogistic in the Physarum behavior. In Section 5, we show how we can implement non- Aristotelian syllogistic defined in [10][12]. II. PHYSARUM L-SYSTEM The behavior of Physarum plasmodia can be stimulated by attractants and repellents. We have the following entities which can be used in programming plasmodia: The set of active zones of Physarum {V 1, V 2,...}, from which any behavior begin to carry out. The set of attractants {A 1, A 2,...}; they are sources of nutrients, on which the plasmodium feeds, or pheromones which chemically attract the plasmodium. Any attractant is characterized by its position and intensity. The set of repellents {R 1, R 2,...}. Plasmodium of Physarum avoids light and some thermo- and saltbased conditions. Thus, domains of high illumination (or high grade of salt) are repellents such that each repellent is characterized by its position and intensity, or force of repelling. The set of protoplasmic tubes {T 1, T 2,...}. Typically, plasmodium spans sources of nutrients with protoplasmic tubes/veins. The plasmodium builds a planar graph, where nodes are sources of nutrients or pheromones, e.g., oat flakes, and edges are protoplasmic tubes. Plasmodia grow from active zones. At these active zones, according to Adamatzky's experiments [2][3], the following 15
2 three basic operations stimulated by nutrients (attractants) and some other conditions can be observed: fusion, multiplication, and direction operations (see Fig. 1): Figure 1. The stimulation of the following operations in Physarum automata: (a) fusion, (b) multiplication, and (c) direction, where A 1, A 2, A 3 are active zones, N, N 1, N 2, N 3 are attractants, is a protoplasmic tube, R is a repellent. (1) The fusion, denoted Fuse, means that two active zones A 1 and A 2 either produce new active zone A 3 (i.e., there is a collision of the active zones) or just a protoplasmic tube : Fuse(A 1, A 2 ) = A 3 or Fuse(A 1, A 2 ) =. (2) The multiplication, Mult, means that the active zone A 1 splits into two independent active zones A 2 and A 3, propagating along their own trajectories: Mult(A 1 ) = {A 2, A 3 } or Mult( ) = {A 2, A 3 }. (3) The direction, Direct, means that the active zone A is not translated to a source of nutrients but to a domain of an active space with certain initial velocity vector v: Direct(A, v). These operations, Fuse, Mult, Direct, can be determined by the attractants {A 1, A 2,...} and repellents {R 1, R 2,...}. On the basis of active zones {V 1, V 2,...}, attractants {A 1, A 2,...}, repellents {R 1, R 2,...}, and protoplasmic tubes {T 1, T 2,...}, we can define a Physarum L-system. Let us remember that an L-system consists of (i) an alphabet of symbols that can be used to make strings, (ii) a collection of production rules that expand each symbol into some larger or shorter string of symbols, and (iii) an initial string from which we move. These systems were introduced by Lindenmayer [4][6][13] to describe and simulate the behavior of plant cells. The Physarum L-system is defined as follows: G = G, ω, Q, where (i) G (the alphabet) is a set of symbols containing elements that can be replaced (variables), namely they are active zones {V 1, V 2,...}, which can be propagated towards attractants {A 1, A 2,...} by protoplasmic tubes and avoid repellents {R 1, R 2,...}, i.e., G = {V 1, V 2,...} {A 1, A 2,...} {R 1, R 2,...}; (ii) ω (start, axiom or initiator) is a string of symbols from G defining the initial state of the system, i.e., ω always belongs to {V 1, V 2,...}; (iii) Q is a set of production rules or productions defining the way variables can be replaced with combinations of constants and other variables, i.e., production rules show a propagation of active zones by protoplasmic tubes towards attractants with avoiding repellents. Let A, B, C are called primary strings, their meanings run over symbols V 1, V 2,..., A 1, A 2,... Production rules allow us to build composite strings from primary strings. So, a production A Q B consists of two strings, the predecessor A and the successor B. Some basic cases of productions are as follows: (i) the fusion, denoted AB Q C, means that two active zones A and B produce new active zone C at the place of an attractant denoted by C; (ii) the multiplication, A Q BC, means that the active zone A splits into two independent active zones B and C propagating along their own trajectories towards two different attractants denoted then by B and C; (iii) the direction, A Q B, means that the active zone A is translated to a source of nutrients B. L-systems can generate infinite data structure. Therefore it is better to define some production rules, denoted by A B, recursively like that: A BA, producing an infinite sequence BABABABA from A, or A BCA, producing an infinite sequence BCABCABCABCA from A. In the Physarum L-system, the rule A BA means that we will fulfill the direction, A Q B, infinitely many time, the rule A BCA means that we will fulfill the multiplication, A Q BC, infinitely many time. Let us consider an example of recursive production rules. Let G = {A, B} and let us start with the string A. Assume (A BA) and (B B). Thus, we obtain the following strings: Generation n = 0 : A Generation n = 1 : BA Generation n = 2 : BBA Generation n = 3 : BBBA Generation n = 4 : BBBBBA Generation n = 5 : BBBBBBA 16
3 In an appropriate Physarum L-system, these generations are represented as an infinite tree by permanent additions new attractants before the plasmodium propagation. In other words, we obtain the binary tree labeled with s and t, and whose interior nodes are either one unary node labeled with B or one binary node labeled with A (Fig. 2). A s = t = t s t Figure 2. Example of labels for binary trees. To sum up, we obtain the infinite binary tree of Fig. 3. If we are limited just by the multiplication, A Q BC, and the direction, A Q B, we can build up binary trees in Physarum L-systems using the following definition of binary trees labeled with x, y,, whose interior nodes are either unary nodes labeled with u 1, u 2, or binary nodes labeled with b 1, b 2, : 1. the variables x, y, are trees; 2. if t is a tree, then adding a single node labeled with one of u 1, u 2, as a new root with t as its only subtree gives a tree; 3. if s and t are trees, then adding a single node labeled with one of b 1, b 2, as a new root with s as the left subtree and t as the right subtree again gives a tree; 4. trees may go on forever. B A A B B A Figure 3. Example of infinite binary tree. Let Tr be the set of trees that we have been defined. Then our definition introduces a coalgebra [14]: Tr = {x, y, } ({u 1, u 2, } Tr) ({b 1, b 2, } Tr Tr). Thus, within L-systems, we can obtain complex structures including infinite structures defined coalgebraically. In some cases, it is better to deal with B infinite structures (infinite trees), assuming that all strings are finite. III. ARISTOTELIAN TREES Let us consider Aristotelian syllogistic trees, which can be large, but their strings are only of the length 1 or 2. An Aristotelian syllogistic tree is labeled with x, y,, its interior nodes are n-ary nodes labeled with b 1, b 2,, and it is defined as follows: (1) the variables x, y, are Aristotelian syllogistic trees whose single descendants are underlying things (hypokeimenon, ὑποκείμενον) such that for each x, y,, parents are supremums of descendants (notice that all underlying things are mutually disjoint); (2) if t 1, t 2,, t n are Aristotelian syllogistic trees such that their tops are concepts which are mutually disjoint and their supremum is b x {b 1, b 2, }, then adding a single node labeled with b x as a new root with t 1, t 2,, t n as its only subtrees gives an Aristotelian syllogistic tree; (3) an Aristotelian syllogistic tree is finite. The idea of hypokeimenon allowed Aristotle to build up finite trees. He starts with underlying things as primary descendants of trees in constructing syllogistic databases. Now, let us define syllogistic strings of the length 1 or 2 by means a Physarum L-system. Let each b x {b 1, b 2, } be presented by an appropriate attractant and underlying things by initial active zones of Physarum. So, first trees x, y,, whose single descendants are underlying things, are obtained by fusion or direction. Their supremums are denoted by attractants which were occupied by the first plasmodium propagation. These trees are considered subtrees for the next plasmodia propagation by fusion or direction. At the end, we can obtain just one supremum combining all subtrees. Let a 1, a 2, a 3, be underlying things. Then they are initial strings, i.e., they can be identified with active zones of plasmodia. Their meanings are as follows: there exists a 1, there exists a 2, there exists a 3, Assume that in the tree structure the supremum of a 1 and a 2 is b 1, the supremum of a 2 and a 3 is b 2, These supremums are fusions of plasmodia. Then, we have the strings a 1 b 1, a 2 b 1, a 2 b 2, a 3 b 2, Their meanings are as follows: a 1 is b 1, a 2 is b 1, a 2 is b 2, a 3 is b 2, Further, let b n be a supremum for b 1 and b 2. It denotes an attractant that was occupied by the plasmodium at the third step of the propagation. Our new strings are as follows: b 1 is b n, b 2 is b n, etc. Now we can appeal also to the following new production rule: if x is y and y is z, then x is z. Thus, we have the strings: a 1 b n, a 2 b n, a 2 b n, a 3 b n, IV. ARISTOTELIAN SYLLOGISTIC The symbolic system of Aristotelian syllogistic can be implemented in the behavior of Physarum plasmodium. Let us design cells of Physarum syllogistic which will designate classes of terms. We can suppose that cells can possess different topological properties. This depends on intensity of chemo-attractants and chemo-repellents. The intensity entails the natural or geographical neighborhood of the set's elements in accordance with the spreading of attractants or repellents. As a result, we obtain Voronoi cells [3][11]. Let us define what they are mathematically. Let P be a nonempty 17
4 finite set of planar points and P = n. For points p = (p 1, p 2 ) and x = (x 1, x 2 ), let d( p, x) = ( p x x1 ) ( p2 2) denote their Euclidean distance. A planar Voronoi diagram of the set P is a partition of the plane into cells, such that for any element of P, a cell corresponding to a unique point p contains all those points of the plane which are closer to p in respect to the distance d than to any other node of P. A unique region vor( p) = m P, m p { z R 2 : d( p, z) < d( m, z)} assigned to the point p is called a Voronoi cell of the point p. Within one Voronoi cell, a reagent has a full power to attract or repel the plasmodium. The distance d is defined by intensity of reagent spreading like in other chemical reactions simulated by Voronoi diagrams. A reagent attracts or repels the plasmodium and the distance on that it is possible corresponds to the elements of a given planar set P. When two spreading wave fronts of two reagents meet, this means that on the board of meeting the plasmodium cannot choose its one further direction and splits (see Fig. 5). Within the same Voronoi cell, two active zones will fuse. Now, we can obtain coordinates (x, y) Z 2 for each Voronoi center. The number (x, y) can be assigned to each concept as its character. If a Voronoi center with the coordinates (x a, y a ) is presented by an attractant that is activated and occupied by the plasmodium, this means that in an appropriate Physarum syllogistic model there exists a string a with the coordinates (x a, y a ). This string has the meaning a exists. If a Voronoi center with the coordinates (x a, y a ) is presented by a repellent that is activated and avoided by the plasmodium, this means that in an appropriate Physarum syllogistic model there exists a string [a] with the coordinates (x a, y a ). This string has the meaning a does not exist. If two neighbor Voronoi cells with the coordinates (x a, y a ) and (x b, y b ) of centers contain activated attractants which are occupied by the plasmodium and between both centers there are protoplasmic tubes, then in an appropriate Physarum syllogistic model there exists a string ab and a string ba where a has the coordinates (x a, y a ) and b has the coordinates (x b, y b ). The meaning of those strings is the same and it is as follows: ab exist, ba exist, some a is b, some b is a. If one neighbor Voronoi cell with the coordinates (x a, y a ) of its center contains an activated attractant which is occupied by the plasmodium and another neighbor Voronoi cell with the coordinates (x b, y b ) of its centre contains an activated repellent which is avoided by the plasmodium, then in an appropriate Physarum L-system there exists a string a[b] and a string [b]a where a has the character (x a, y a ) and [b] has the character (x b, y b ). The meaning of those strings is the same and it is as follows: ab do not exist, but a exists without b, there exists a and no a is b, no b is a and there exists a, a exists and b does not exist. If two neighbor Voronoi cells with the coordinates (x a, y a ) and (x b, y b ) of their centers contain activated repellents which are avoided by the plasmodium, then in an appropriate Physarum L-system there exists a string [ab] and a string [ba] where [a] has the character (x a, y a ) and [b] has the character (x b, y b ). The meaning of those strings is the same and it is as follows: ab do not exist together, there are no a and there are no b, no b is a, no a is b. Hence, existence propositions of Aristotelian syllogistic are spatially implemented in Physarum L-systems. Let y' denote all neighbor Voronoi cells for x which differ from y. Now, let us consider a complex string xy&x[y']. The sign & means that we have strings xy and x[y'] simultaneously and they are considered the one complex string. The meaning of the string xy&x[y'] is a universal affirmative proposition all x are y. As a consequence, each Physarum L-system is considered a discourse universe verifying some propositions of Aristotelian syllogistic. V. NON-ARISTOTELIAN SYLLOGISTIC Let us propose now the syllogistic system formalizing performative propositions of the form A is P (see [10][12]), i.e., propositions with context-based meanings. This system is said to be synthetic (pragmatic) syllogistic, while we are assuming that Aristotelian syllogistic is analytic (informative). The basic logical connectives of pragmatic syllogistic are as follows: a ( every + noun + is + adjective ), i ( some + noun + is + adjective ), e ( no + noun + is + adjective ) and o ( some + noun + is not + adjective ) that are defined in the following way: SaP:= A (A is S) ( A(A is S A is P)). SiP:= A( (A is S) (A is P)). SoP:= ( A (A is S) ( A(A is S A is P))), i.e., A (A is S) ( A( (A is S) (A is P))). SeP:= ( A( (A is S) (A is P))), i.e., A(A is S A is P). Now, let us formulate axioms of pragmatic syllogistic: SaP SeP. SaP PaS. SiP PiS. SaM SeP. MaP SeP. 18
5 (MaP SaM) SaP (MiP SiM) SiP. In pragmatic syllogistic, we have a novel square of opposition that we call the synthetic square of opposition (see Fig. 4), where the following theorems are inferred from (1) (11): SaP SeP SiP SoP Figure 4. The synthetic square of opposition. SaP (SoP), (SoP) SaP, SiP (SeP), (SeP) SiP, SeP (SiP), (SiP) SeP, SoP (SaP), (SaP) SoP, SaP (SiP), SiP (SaP), (SeP) SoP, (SoP) SeP, SaP SeP, SiP SoP, SeP SiP, (SeP SiP), SaP SoP, (SaP SoP), (SaP SiP), SeP SoP. For more details, see [10][12]. In the implementations within Physarum L-systems, the four basic syllogistic propositions of non-aristotelian syllogistic defined above are understood as follows: All S are P : there is a string AS and for any A which is a neighbor for S and P, there are strings AS and AP. This means that we have a massive-parallel occupation of region, where the cells S and P are located. Some S are P : for any A which is a neighbor for S and P, there are no strings AS and AP. This means that the plasmodium cannot reach S from P or P from S immediately. No S are P : there exists A which is a neighbor for S and P such that there is a string AS or there is a string AP. This means that the plasmodium occupies S or P, but surely not the whole region, where the cells S and P are located. Some S are not P : for any A which is a neighbor for S and P there is no string AS or there exist A which is a neighbor for S and P such that there is no string AS or there is no string AP. This means that the plasmodium does not occupy S or there is a neighbor cell which is not connected with S or P by a protoplasmic tube. Thus, the pragmatic syllogistic allows us to study different zones containing attractants for Physarum if they are connected by protoplasmic tubes homogenously. VI. CONCLUSION We constructed two syllogistic versions of storage modification machine in Physarum Polycephalum: Aristotelian syllogistic and pragmatic syllogistic (non- Aristotelian syllogistic of Section 5). While Aristotelian syllogistic may describe concrete directions of Physarum spatial expansions, pragmatic syllogistic may describe Physarum simultaneous propagations in all directions. Therefore, while for the implementation of Aristotelian syllogistic we need repellents to avoid some possibilities in the Physarum propagations, for the implementation of pragmatic syllogistic we do not need them. Hence, the second syllogistic can simulate massive-parallel behaviors, including different form of propagations such as processes of public opinion formation. In our opinion, the general purpose of Physarum computing covers many behavioural sciences, because the slime mould s behaviour can be considered the simplest natural intelligent behaviour. Thus, our results may have an impact on computational models in behavioural sciences in general. ACKNOWLEDGMENT This research is supported by FP7-ICT and UMO-2012/07/B/HS1/ REFERENCES [1] A. Adamatzky, V. Erokhin, M. Grube, Th. Schubert, and A. Schumann, Physarum Chip Project: Growing Computers From Slime Mould, International Journal of Unconventional Computing, 8(4), 2012, pp [2] A. Adamatzky, Physarum machine: implementation of a Kolmogorov-Uspensky machine on a biological substrate, Parallel Processing Letters, vol. 17, no. 04, 2007, pp [3] A. Adamatzky, Physarum Machines: Computers from Slime Mould (World Scientific Series on Nonlinear Science, Series A). World Scientific Publishing Company, [4] A. Lindenmayer, Mathematical models for cellular interaction in development. parts I and II, Journal of Theoretical Biology, 18, 1968, pp ; [5] J. Łukasiewicz, Aristotle's Syllogistic From the Standpoint of Modern Formal Logic. Oxford Clarendon Press, 2nd edition, [6] K. Niklas, Computer Simulated Plant Evolution. Scientific American, [7] A. Schumann and A. Adamatzky, Logical Modelling of Physarum Polycephalum, Analele Universitatii Din Timisoara, seria Matemtica-Informatica 48 (3), 2010, pp [8] A. Schumann and A. Adamatzky, Physarum Spatial Logic, New Mathematics and Natural Computation 7 (3), 2011, pp [9] A. Schumann and L. Akimova, Simulating of Schistosomatidae (Trematoda: Digenea) Behaviour by Physarum Spatial Logic, Annals of Computer Science and Information Systems, Volume 1. Proceedings of the 2013 Federated Conference on Computer Science and Information Systems. IEEE Xplore, 2013, pp
6 [10] A. Schumann, On Two Squares of Opposition: the Leśniewski s Style Formalization of Synthetic Propositions, Acta Analytica 28, 2013, pp [11] A. Schumann and K. Pancerz, Towards an Object-Oriented Programming Language for Physarum Polycephalum Computing, in M. Szczuka, L. Czaja, M. Kacprzak (eds.), Proceedings of the Workshop on Concurrency, Specification and Programming (CS&P'2013), Warsaw, Poland, September 25-27, 2013, pp [12] A. Schumann, Two Squares of Opposition: for Analytic and Synthetic Propositions, Bulletin of the Section of Logic 40 (3/4), 2011, pp [13] P. Prusinkiewicz and A. Lindenmayer, The Algorithmic Beauty of Plants. Springer-Verlag, [14] J. J. M. M. Rutten, Universal coalgebra: a theory of systems, Theor. Comput. Sci., 249 (1), 2000, pp Figure 5. The Voronoi diagram for Physarum, where different attractants have different intensity and power. 20
Go Games on Plasmodia of Physarum Polycephalum
Proceedings of the Federated Conference on Computer Science and Information Systems pp. 615 626 DOI: 10.15439/2015F236 ACSIS, Vol. 5 Go Games on Plasmodia of Physarum Polycephalum Andrew Schumann University
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 informationDiscrete Mathematics
Discrete Mathematics Yi Li Software School Fudan University March 13, 2017 Yi Li (Fudan University) Discrete Mathematics March 13, 2017 1 / 1 Review of Lattice Ideal Special Lattice Boolean Algebra Yi
More informationON A MINIMAL SYSTEM OF ARISTOTLE S SYLLOGISTIC
Bulletin of the Section of Logic Volume 40:3/4 (0), pp. 9 45 Piotr Kulicki ON A MINIMAL SYSTEM OF ARISTOTLE S SYLLOGISTIC Abstract The system of Syllogistic presented by J. S lupecki is a minimal, Lukasiewicz
More informationFoundations of Mathematics
Foundations of Mathematics Andrew Monnot 1 Construction of the Language Loop We must yield to a cyclic approach in the foundations of mathematics. In this respect we begin with some assumptions of language
More information11. Automata and languages, cellular automata, grammars, L-systems
11. Automata and languages, cellular automata, grammars, L-systems 11.1 Automata and languages Automaton (pl. automata): in computer science, a simple model of a machine or of other systems. ( a simplification
More informationbiologically-inspired computing lecture 6 Informatics luis rocha 2015 INDIANA UNIVERSITY biologically Inspired computing
lecture 6 -inspired Sections I485/H400 course outlook Assignments: 35% Students will complete 4/5 assignments based on algorithms presented in class Lab meets in I1 (West) 109 on Lab Wednesdays Lab 0 :
More informationSection Summary. Relations and Functions Properties of Relations. Combining Relations
Chapter 9 Chapter Summary Relations and Their Properties n-ary Relations and Their Applications (not currently included in overheads) Representing Relations Closures of Relations (not currently included
More informationLanguages. Languages. An Example Grammar. Grammars. Suppose we have an alphabet V. Then we can write:
Languages A language is a set (usually infinite) of strings, also known as sentences Each string consists of a sequence of symbols taken from some alphabet An alphabet, V, is a finite set of symbols, e.g.
More informationRelations. We have seen several types of abstract, mathematical objects, including propositions, predicates, sets, and ordered pairs and tuples.
Relations We have seen several types of abstract, mathematical objects, including propositions, predicates, sets, and ordered pairs and tuples. Relations use ordered tuples to represent relationships among
More informationRealization of Coinductive Types
MFPS 2011 Realization of Coinductive Types Dexter Kozen 1,2 Department of Computer Science Cornell University Ithaca, New York 14853 7501, USA Abstract We give an explicit combinatorial construction of
More informationCVO103: Programming Languages. Lecture 2 Inductive Definitions (2)
CVO103: Programming Languages Lecture 2 Inductive Definitions (2) Hakjoo Oh 2018 Spring Hakjoo Oh CVO103 2018 Spring, Lecture 2 March 13, 2018 1 / 20 Contents More examples of inductive definitions natural
More informationLogic Background (1A) Young W. Lim 12/14/15
Young W. Lim 12/14/15 Copyright (c) 2014-2015 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any
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 informationTheory of Computation
Theory of Computation (Feodor F. Dragan) Department of Computer Science Kent State University Spring, 2018 Theory of Computation, Feodor F. Dragan, Kent State University 1 Before we go into details, what
More informationChapter 0 Introduction. Fourth Academic Year/ Elective Course Electrical Engineering Department College of Engineering University of Salahaddin
Chapter 0 Introduction Fourth Academic Year/ Elective Course Electrical Engineering Department College of Engineering University of Salahaddin October 2014 Automata Theory 2 of 22 Automata theory deals
More informationModeling Neural Processes in Lindenmayer Systems
Modeling Neural Processes in Lindenmayer Systems Carlos Martín-Vide and Tseren-Onolt Ishdorj Research Group on Mathematical Linguistics Rovira i Virgili University Pl. Imperial Tàrraco 1, 43005 Tarragona,
More informationEquational Logic. Chapter Syntax Terms and Term Algebras
Chapter 2 Equational Logic 2.1 Syntax 2.1.1 Terms and Term Algebras The natural logic of algebra is equational logic, whose propositions are universally quantified identities between terms built up from
More informationTheory of Computation
Theory of Computation Lecture #2 Sarmad Abbasi Virtual University Sarmad Abbasi (Virtual University) Theory of Computation 1 / 1 Lecture 2: Overview Recall some basic definitions from Automata Theory.
More informationLinear Temporal Logic and Büchi Automata
Linear Temporal Logic and Büchi Automata Yih-Kuen Tsay Department of Information Management National Taiwan University FLOLAC 2009 Yih-Kuen Tsay (SVVRL @ IM.NTU) Linear Temporal Logic and Büchi Automata
More informationUniversal Algebra for Logics
Universal Algebra for Logics Joanna GRYGIEL University of Czestochowa Poland j.grygiel@ajd.czest.pl 2005 These notes form Lecture Notes of a short course which I will give at 1st School on Universal Logic
More informationSOME TRANSFINITE INDUCTION DEDUCTIONS
SOME TRANSFINITE INDUCTION DEDUCTIONS SYLVIA DURIAN Abstract. This paper develops the ordinal numbers and transfinite induction, then demonstrates some interesting applications of transfinite induction.
More informationLanguage-Restricted Iterated Function Systems, Koch Constructions, and L-systems
Language-Restricted Iterated Function Systems, Koch Constructions, and L-systems Przemyslaw Prusinkiewicz and Mark Hammel Department of Computer Science University of Calgary Calgary, Alberta, Canada T2N
More informationAutomata-based Verification - III
COMP30172: Advanced Algorithms Automata-based Verification - III Howard Barringer Room KB2.20: email: howard.barringer@manchester.ac.uk March 2009 Third Topic Infinite Word Automata Motivation Büchi Automata
More informationWhat is this course about?
What is this course about? Examining the power of an abstract machine What can this box of tricks do? What is this course about? Examining the power of an abstract machine Domains of discourse: automata
More informationDefinition: A binary relation R from a set A to a set B is a subset R A B. Example:
Chapter 9 1 Binary Relations Definition: A binary relation R from a set A to a set B is a subset R A B. Example: Let A = {0,1,2} and B = {a,b} {(0, a), (0, b), (1,a), (2, b)} is a relation from A to B.
More information03 Review of First-Order Logic
CAS 734 Winter 2014 03 Review of First-Order Logic William M. Farmer Department of Computing and Software McMaster University 18 January 2014 What is First-Order Logic? First-order logic is the study of
More informationUNIT-I. Strings, Alphabets, Language and Operations
UNIT-I Strings, Alphabets, Language and Operations Strings of characters are fundamental building blocks in computer science. Alphabet is defined as a non empty finite set or nonempty set of symbols. The
More informationAutomata: a short introduction
ILIAS, University of Luxembourg Discrete Mathematics II May 2012 What is a computer? Real computers are complicated; We abstract up to an essential model of computation; We begin with the simplest possible
More informationarxiv:cs/ v1 [cs.dm] 7 May 2006
arxiv:cs/0605026v1 [cs.dm] 7 May 2006 Strongly Almost Periodic Sequences under Finite Automata Mappings Yuri Pritykin April 11, 2017 Abstract The notion of almost periodicity nontrivially generalizes the
More informationHarvard CS121 and CSCI E-121 Lecture 2: Mathematical Preliminaries
Harvard CS121 and CSCI E-121 Lecture 2: Mathematical Preliminaries Harry Lewis September 5, 2013 Reading: Sipser, Chapter 0 Sets Sets are defined by their members A = B means that for every x, x A iff
More informationRelational dual tableaux for interval temporal logics *
Relational dual tableaux for interval temporal logics * Davide Bresolin * Joanna Golińska-Pilarek ** Ewa Orłowska ** * Department of Mathematics and Computer Science University of Udine (Italy) bresolin@dimi.uniud.it
More informationbiologically-inspired computing lecture 18
Informatics -inspired lecture 18 Sections I485/H400 course outlook Assignments: 35% Students will complete 4/5 assignments based on algorithms presented in class Lab meets in I1 (West) 109 on Lab Wednesdays
More informationRequirements Validation. Content. What the standards say (*) ?? Validation, Verification, Accreditation!! Correctness and completeness
Requirements Validation Requirements Management Requirements Validation?? Validation, Verification, Accreditation!! Check if evrything is OK With respect to what? Mesurement associated with requirements
More informationOn bounded redundancy of universal codes
On bounded redundancy of universal codes Łukasz Dębowski Institute of omputer Science, Polish Academy of Sciences ul. Jana Kazimierza 5, 01-248 Warszawa, Poland Abstract onsider stationary ergodic measures
More informationOn the coinductive nature of centralizers
On the coinductive nature of centralizers Charles Grellois INRIA & University of Bologna Séminaire du LIFO Jan 16, 2017 Charles Grellois (INRIA & Bologna) On the coinductive nature of centralizers Jan
More informationChapter 6. Properties of Regular Languages
Chapter 6 Properties of Regular Languages Regular Sets and Languages Claim(1). The family of languages accepted by FSAs consists of precisely the regular sets over a given alphabet. Every regular set is
More information{a, b, c} {a, b} {a, c} {b, c} {a}
Section 4.3 Order Relations A binary relation is an partial order if it transitive and antisymmetric. If R is a partial order over the set S, we also say, S is a partially ordered set or S is a poset.
More informationP Systems with Symport/Antiport of Rules
P Systems with Symport/Antiport of Rules Matteo CAVALIERE Research Group on Mathematical Linguistics Rovira i Virgili University Pl. Imperial Tárraco 1, 43005 Tarragona, Spain E-mail: matteo.cavaliere@estudiants.urv.es
More informationBasing Decisions on Sentences in Decision Diagrams
Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence Basing Decisions on Sentences in Decision Diagrams Yexiang Xue Department of Computer Science Cornell University yexiang@cs.cornell.edu
More informationBOOLEAN ALGEBRA INTRODUCTION SUBSETS
BOOLEAN ALGEBRA M. Ragheb 1/294/2018 INTRODUCTION Modern algebra is centered around the concept of an algebraic system: A, consisting of a set of elements: ai, i=1, 2,, which are combined by a set of operations
More informationCMSC 330: Organization of Programming Languages
CMSC 330: Organization of Programming Languages Theory of Regular Expressions DFAs and NFAs Reminders Project 1 due Sep. 24 Homework 1 posted Exam 1 on Sep. 25 Exam topics list posted Practice homework
More informationDiscrete Mathematics. Spring 2017
Discrete Mathematics Spring 2017 Previous Lecture Principle of Mathematical Induction Mathematical Induction: Rule of Inference Mathematical Induction: Conjecturing and Proving Mathematical Induction:
More informationDescriptional Complexity of Formal Systems (Draft) Deadline for submissions: April 20, 2009 Final versions: June 18, 2009
DCFS 2009 Descriptional Complexity of Formal Systems (Draft) Deadline for submissions: April 20, 2009 Final versions: June 18, 2009 On the Number of Membranes in Unary P Systems Rudolf Freund (A,B) Andreas
More informationCS375: Logic and Theory of Computing
CS375: Logic and Theory of Computing Fuhua (Frank) Cheng Department of Computer Science University of Kentucky 1 Table of Contents: Week 1: Preliminaries (set algebra, relations, functions) (read Chapters
More informationWhat we have done so far
What we have done so far DFAs and regular languages NFAs and their equivalence to DFAs Regular expressions. Regular expressions capture exactly regular languages: Construct a NFA from a regular expression.
More informationAutomata and Languages
Automata and Languages Prof. Mohamed Hamada Software Engineering Lab. The University of Aizu Japan Mathematical Background Mathematical Background Sets Relations Functions Graphs Proof techniques Sets
More informationFoundations of Mathematics
Foundations of Mathematics L. Pedro Poitevin 1. Preliminaries 1.1. Sets We will naively think of a set as a collection of mathematical objects, called its elements or members. To indicate that an object
More informationAutomata-based Verification - III
CS3172: Advanced Algorithms Automata-based Verification - III Howard Barringer Room KB2.20/22: email: howard.barringer@manchester.ac.uk March 2005 Third Topic Infinite Word Automata Motivation Büchi Automata
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 informationCS:4330 Theory of Computation Spring Regular Languages. Finite Automata and Regular Expressions. Haniel Barbosa
CS:4330 Theory of Computation Spring 2018 Regular Languages Finite Automata and Regular Expressions Haniel Barbosa Readings for this lecture Chapter 1 of [Sipser 1996], 3rd edition. Sections 1.1 and 1.3.
More informationCS375 Midterm Exam Solution Set (Fall 2017)
CS375 Midterm Exam Solution Set (Fall 2017) Closed book & closed notes October 17, 2017 Name sample 1. (10 points) (a) Put in the following blank the number of strings of length 5 over A={a, b, c} that
More informationStanford Encyclopedia of Philosophy
Stanford Encyclopedia of Philosophy The Mathematics of Boolean Algebra First published Fri Jul 5, 2002; substantive revision Mon Jul 14, 2014 Boolean algebra is the algebra of two-valued logic with only
More informationThe exam is closed book, closed calculator, and closed notes except your one-page crib sheet.
CS 188 Fall 2015 Introduction to Artificial Intelligence Final You have approximately 2 hours and 50 minutes. The exam is closed book, closed calculator, and closed notes except your one-page crib sheet.
More informationNondeterminism. September 7, Nondeterminism
September 7, 204 Introduction is a useful concept that has a great impact on the theory of computation Introduction is a useful concept that has a great impact on the theory of computation So far in our
More informationAbstract model theory for extensions of modal logic
Abstract model theory for extensions of modal logic Balder ten Cate Stanford, May 13, 2008 Largely based on joint work with Johan van Benthem and Jouko Väänänen Balder ten Cate Abstract model theory for
More informationIntroduction. Büchi Automata and Model Checking. Outline. Büchi Automata. The simplest computation model for infinite behaviors is the
Introduction Büchi Automata and Model Checking Yih-Kuen Tsay Department of Information Management National Taiwan University FLOLAC 2009 The simplest computation model for finite behaviors is the finite
More informationTowards a formal language for systemic requirements
Towards a formal language for systemic requirements LIX, Yann Hourdel École Polytechnique, 91128 Palaiseau Cedex, France, yann.hourdel@polytechnique.edu Abstract. This work is an attempt to contribute
More informationPhilosophy of Religion. Notes on Infinity
Notes on Infinity Infinity in Classical and Medieval Philosophy Aristotle (Metaphysics 986 a 22) reports that limited (peras, πέρας) and unlimited or infinite (apeiron, ἄπειρον) occur as the first pairing
More informationA FRAGMENT OF BOOLE S ALGEBRAIC LOGIC SUITABLE FOR TRADITIONAL SYLLOGISTIC LOGIC
A FRAGMENT OF BOOLE S ALGEBRAIC LOGIC SUITABLE FOR TRADITIONAL SYLLOGISTIC LOGIC STANLEY BURRIS 1. Introduction Boole introduced his agebraic approach to logic in 1847 in an 82 page monograph, The Mathematical
More informationAdvanced Automata Theory 10 Transducers and Rational Relations
Advanced Automata Theory 10 Transducers and Rational Relations Frank Stephan Department of Computer Science Department of Mathematics National University of Singapore fstephan@comp.nus.edu.sg Advanced
More informationProgramming Languages and Types
Programming Languages and Types Klaus Ostermann based on slides by Benjamin C. Pierce Where we re going Type Systems... Type systems are one of the most fascinating and powerful aspects of programming
More informationSounds Synthesis with Slime Mould of Physarum Polycephalum
Sounds Synthesis with Slime Mould of Physarum Polycephalum Eduardo R. Miranda 1, Andrew Adamatzky 2 and Jeff Jones 2 1 Interdisciplinary Centre for Computer Music Research (ICCMR), University of Plymouth,
More informationCOSE212: Programming Languages. Lecture 1 Inductive Definitions (1)
COSE212: Programming Languages Lecture 1 Inductive Definitions (1) Hakjoo Oh 2017 Fall Hakjoo Oh COSE212 2017 Fall, Lecture 1 September 4, 2017 1 / 9 Inductive Definitions Inductive definition (induction)
More informationFinite State Machines 2
Finite State Machines 2 Joseph Spring School of Computer Science 1COM0044 Foundations of Computation 1 Discussion Points In the last lecture we looked at: 1. Abstract Machines 2. Finite State Machines
More informationFirst Order Logic (1A) Young W. Lim 11/18/13
Copyright (c) 2013. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software
More informationEECS 229A Spring 2007 * * (a) By stationarity and the chain rule for entropy, we have
EECS 229A Spring 2007 * * Solutions to Homework 3 1. Problem 4.11 on pg. 93 of the text. Stationary processes (a) By stationarity and the chain rule for entropy, we have H(X 0 ) + H(X n X 0 ) = H(X 0,
More informationKönig s Lemma and Kleene Tree
König s Lemma and Kleene Tree Andrej Bauer May 3, 2006 Abstract I present a basic result about Cantor space in the context of computability theory: the computable Cantor space is computably non-compact.
More informationBASIC MATHEMATICAL TECHNIQUES
CHAPTER 1 ASIC MATHEMATICAL TECHNIQUES 1.1 Introduction To understand automata theory, one must have a strong foundation about discrete mathematics. Discrete mathematics is a branch of mathematics dealing
More informationA SIMPLE AXIOMATIZATION OF LUKASIEWICZ S MODAL LOGIC
Bulletin of the Section of Logic Volume 41:3/4 (2012), pp. 149 153 Zdzis law Dywan A SIMPLE AXIOMATIZATION OF LUKASIEWICZ S MODAL LOGIC Abstract We will propose a new axiomatization of four-valued Lukasiewicz
More informationEnumeration Schemes for Words Avoiding Permutations
Enumeration Schemes for Words Avoiding Permutations Lara Pudwell November 27, 2007 Abstract The enumeration of permutation classes has been accomplished with a variety of techniques. One wide-reaching
More informationIntroduction to Artificial Life and Cellular Automata. Cellular Automata
Introduction to Artificial Life and Cellular Automata CS405 Cellular Automata A cellular automata is a family of simple, finite-state machines that exhibit interesting, emergent behaviors through their
More informationThe Pumping Lemma. for all n 0, u 1 v n u 2 L (i.e. u 1 u 2 L, u 1 vu 2 L [but we knew that anyway], u 1 vvu 2 L, u 1 vvvu 2 L, etc.
The Pumping Lemma For every regular language L, there is a number l 1 satisfying the pumping lemma property: All w L with w l can be expressed as a concatenation of three strings, w = u 1 vu 2, where u
More informationFurther discussion of Turing machines
Further discussion of Turing machines In this lecture we will discuss various aspects of decidable and Turing-recognizable languages that were not mentioned in previous lectures. In particular, we will
More informationBootstrap Percolation on Periodic Trees
Bootstrap Percolation on Periodic Trees Milan Bradonjić Iraj Saniee Abstract We study bootstrap percolation with the threshold parameter θ 2 and the initial probability p on infinite periodic trees that
More informationCOSE212: Programming Languages. Lecture 1 Inductive Definitions (1)
COSE212: Programming Languages Lecture 1 Inductive Definitions (1) Hakjoo Oh 2018 Fall Hakjoo Oh COSE212 2018 Fall, Lecture 1 September 5, 2018 1 / 10 Inductive Definitions Inductive definition (induction)
More informationParikh s theorem. Håkan Lindqvist
Parikh s theorem Håkan Lindqvist Abstract This chapter will discuss Parikh s theorem and provide a proof for it. The proof is done by induction over a set of derivation trees, and using the Parikh mappings
More informationWith Question/Answer Animations
Chapter 5 With Question/Answer Animations Copyright McGraw-Hill Education. All rights reserved. No reproduction or distribution without the prior written consent of McGraw-Hill Education. Chapter Summary
More informationP systems based on tag operations
Computer Science Journal of Moldova, vol.20, no.3(60), 2012 P systems based on tag operations Yurii Rogozhin Sergey Verlan Abstract In this article we introduce P systems using Post s tag operation on
More informationarxiv: v1 [cs.lo] 16 Jul 2017
SOME IMPROVEMENTS IN FUZZY TURING MACHINES HADI FARAHANI arxiv:1707.05311v1 [cs.lo] 16 Jul 2017 Department of Computer Science, Shahid Beheshti University, G.C, Tehran, Iran h farahani@sbu.ac.ir Abstract.
More informationTree Adjoining Grammars
Tree Adjoining Grammars TAG: Parsing and formal properties Laura Kallmeyer & Benjamin Burkhardt HHU Düsseldorf WS 2017/2018 1 / 36 Outline 1 Parsing as deduction 2 CYK for TAG 3 Closure properties of TALs
More informationCSE 135: Introduction to Theory of Computation Nondeterministic Finite Automata (cont )
CSE 135: Introduction to Theory of Computation Nondeterministic Finite Automata (cont ) Sungjin Im University of California, Merced 2-3-214 Example II A ɛ B ɛ D F C E Example II A ɛ B ɛ D F C E NFA accepting
More informationOn the Sizes of Decision Diagrams Representing the Set of All Parse Trees of a Context-free Grammar
Proceedings of Machine Learning Research vol 73:153-164, 2017 AMBN 2017 On the Sizes of Decision Diagrams Representing the Set of All Parse Trees of a Context-free Grammar Kei Amii Kyoto University Kyoto
More informationModelling with cellular automata
Modelling with cellular automata Shan He School for Computational Science University of Birmingham Module 06-23836: Computational Modelling with MATLAB Outline Outline of Topics Concepts about cellular
More informationCS6901: review of Theory of Computation and Algorithms
CS6901: review of Theory of Computation and Algorithms Any mechanically (automatically) discretely computation of problem solving contains at least three components: - problem description - computational
More informationOn P Systems with Active Membranes
On P Systems with Active Membranes Andrei Păun Department of Computer Science, University of Western Ontario London, Ontario, Canada N6A 5B7 E-mail: apaun@csd.uwo.ca Abstract. The paper deals with the
More informationCSci 311, Models of Computation Chapter 4 Properties of Regular Languages
CSci 311, Models of Computation Chapter 4 Properties of Regular Languages H. Conrad Cunningham 29 December 2015 Contents Introduction................................. 1 4.1 Closure Properties of Regular
More informationThe Importance of Being Formal. Martin Henz. February 5, Propositional Logic
The Importance of Being Formal Martin Henz February 5, 2014 Propositional Logic 1 Motivation In traditional logic, terms represent sets, and therefore, propositions are limited to stating facts on sets
More informationSuppose h maps number and variables to ɛ, and opening parenthesis to 0 and closing parenthesis
1 Introduction Parenthesis Matching Problem Describe the set of arithmetic expressions with correctly matched parenthesis. Arithmetic expressions with correctly matched parenthesis cannot be described
More informationTransformation of Corecursive Graphs
Transformation of Corecursive Graphs Towards M-Adhesive Categories of Corecursive Graphs Julia Padberg 10.2.2017 Padberg Transformation of Corecursive Graphs 10.2.2017 1 Motivation Table of Contents 1
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 information3. Only sequences that were formed by using finitely many applications of rules 1 and 2, are propositional formulas.
1 Chapter 1 Propositional Logic Mathematical logic studies correct thinking, correct deductions of statements from other statements. Let us make it more precise. A fundamental property of a statement is
More informationPropositional and Predicate Logic - IV
Propositional and Predicate Logic - IV Petr Gregor KTIML MFF UK ZS 2015/2016 Petr Gregor (KTIML MFF UK) Propositional and Predicate Logic - IV ZS 2015/2016 1 / 19 Tableau method (from the previous lecture)
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 informationModel Checking. Temporal Logic. Fifth International Symposium in Programming, volume. of concurrent systems in CESAR. In Proceedings of the
Sérgio Campos, Edmund Why? Advantages: No proofs Fast Counter-examples No problem with partial specifications can easily express many concurrency properties Main Disadvantage: State Explosion Problem Too
More informationbiologically-inspired computing lecture 5 Informatics luis rocha 2015 biologically Inspired computing INDIANA UNIVERSITY
lecture 5 -inspired Sections I485/H400 course outlook Assignments: 35% Students will complete 4/5 assignments based on algorithms presented in class Lab meets in I1 (West) 109 on Lab Wednesdays Lab 0 :
More informationA Decidable Class of Planar Linear Hybrid Systems
A Decidable Class of Planar Linear Hybrid Systems Pavithra Prabhakar, Vladimeros Vladimerou, Mahesh Viswanathan, and Geir E. Dullerud University of Illinois at Urbana-Champaign. Abstract. The paper shows
More informationA short introduction to mereology
A short introduction to mereology Department of Logic Nicolaus Copernicus University Toruń, Poland Winter School in Analysis section Topology, Hejnice 2010 Outline 1 Philosophical basis of mereology Parts
More informationPreliminaries. Introduction to EF-games. Inexpressivity results for first-order logic. Normal forms for first-order logic
Introduction to EF-games Inexpressivity results for first-order logic Normal forms for first-order logic Algorithms and complexity for specific classes of structures General complexity bounds Preliminaries
More informationIntroduction to Theoretical Computer Science. Motivation. Automata = abstract computing devices
Introduction to Theoretical Computer Science Motivation Automata = abstract computing devices Turing studied Turing Machines (= computers) before there were any real computers We will also look at simpler
More information