Overlapping tile automata:
|
|
- Terence Watson
- 5 years ago
- Views:
Transcription
1 Overlapping tile automata: towards a language theory of overlapping structures David Janin LaBRI, Université de Bordeaux Computer Science in Russia, Ekaterinburg, june 2013
2 1. From strings to overlapping tiles As an introduction
3 From strings to strings with memory Alphabet A = {a, b, c, } and dual alphabet Ā = {ā, b, c, } Right action sequence w with add (A) or remove (Ā) Memoryless resulting value s w : string a b 1 Resulting value with linear memory: overlapping tiles a b
4 From strings to strings with memory Alphabet A = {a, b, c, } and dual alphabet Ā = {ā, b, c, } Right action sequence w with add (A) or remove (Ā) Memoryless resulting value s w : string a a b a Resulting value with linear memory: overlapping tiles a b a
5 From strings to strings with memory Alphabet A = {a, b, c, } and dual alphabet Ā = {ā, b, c, } Right action sequence w with add (A) or remove (Ā) ab Memoryless resulting value s w : string a b a b Resulting value with linear memory: overlapping tiles a b a b
6 From strings to strings with memory Alphabet A = {a, b, c, } and dual alphabet Ā = {ā, b, c, } Right action sequence w with add (A) or remove (Ā) ab b Memoryless resulting value s w : string a b a Resulting value with linear memory: overlapping tiles a b a b
7 From strings to strings with memory Alphabet A = {a, b, c, } and dual alphabet Ā = {ā, b, c, } Right action sequence w with add (A) or remove (Ā) ab bā Memoryless resulting value s w : string a b Resulting value with linear memory: overlapping tiles a b a b
8 From strings to strings with memory Alphabet A = {a, b, c, } and dual alphabet Ā = {ā, b, c, } Right action sequence w with add (A) or remove (Ā) ab bā b Memoryless resulting value s w : string a Resulting value with linear memory: overlapping tiles a b a b
9 From strings to strings with memory Alphabet A = {a, b, c, } and dual alphabet Ā = {ā, b, c, } Right action sequence w with add (A) or remove (Ā) ab bā bb Memoryless resulting value s w : string a b Resulting value with linear memory: overlapping tiles a b a b
10 From strings to strings with memory Alphabet A = {a, b, c, } and dual alphabet Ā = {ā, b, c, } Right action sequence w with add (A) or remove (Ā) ab bā bbb Memoryless resulting value s w : string a b b Resulting value with linear memory: overlapping tiles a b a b b Undefined!
11 From strings to strings with memory Alphabet A = {a, b, c, } and dual alphabet Ā = {ā, b, c, } Right action sequence w with add (A) or remove (Ā) ab bā bbb Memoryless resulting value s w : string a b b Resulting value with tree-shaped memory: birooted trees a b a b b (see ICALP 2013)
12 (Towards) non classical language theory What language theoretic tools? Automata, partial algebra, logic... for languages of sequences of actions?
13 2. Overlapping tiles monoids Towards McAlister (inverse) monoid [5]
14 The monoid T A of overlapping tiles (McAlister 70 s) Given alphabet A: Overlapping tiles (u) u 1 u 2 u 3 (positive)
15 The monoid T A of overlapping tiles (McAlister 70 s) Given alphabet A: Overlapping tiles (u ) u 1 u 2 u 3 (negative)
16 The monoid T A of overlapping tiles (McAlister 70 s) Given alphabet A: Overlapping tiles product (u) u 1 u 2 u 3 (v) v 1 v 2 v 3
17 The monoid T A of overlapping tiles (McAlister 70 s) Given alphabet A: Overlapping tiles product (u) (v) u 1 u 2 u 3 v 1 v 2 v 3 Synchronization
18 The monoid T A of overlapping tiles (McAlister 70 s) Given alphabet A: Overlapping tiles product (u) (v) u 1 u 2 u 3 v 1 v 2 v 3 (u v) w 1 w 2 w 3 Fusion when u 1 u 2 s v 1 0 and u 3 p v 2 v 3 0
19 The monoid T A of overlapping tiles (McAlister 70 s) Given alphabet A: Overlapping tiles (u) (v) u 1 u 2 u 3 v 1 v 2 v 3 (u v) 0 and undefined otherwise
20 Inverses Monoid T 0 A is an inverse monoid [6, 4] Inverses : u u 1 u = u and u 1 u u 1 = u 1 (unique) u 1 u 2 u 3 (u) (u 1 u 1 u 2 u 3 )
21 Inverses and idempotents Monoid TA 0 is an inverse monoid [6, 4] Inverses : u u 1 u = u and u 1 u u 1 = u 1 (unique) u 1 u 2 u 3 (u) (u 1 u 1 u 2 u 3 ) Idempotents : e e = e (or projections uu 1 and u 1 u) (u R = u u 1 u 1 u 2 u 3 ) (u L = u 1 u 1 u 2 u 3 u)
22 Natural order Definition: 0 v u u 1 u 2 u 3 (u) v 1 u 1 u 2 u 3 v 3 (v) Lemma v u iff v = v R u iff v = uv L Lemma (subunits vs idempotents vs self inverse) e 1 iff e e = e iff e 1 = e
23 3. Overlapping tile automata Automata for overlapping tiles
24 Overlapping tiles as FO-structures Induced FO-structure Every non zero overlapping tile u, e.g. ab abc b (u) is just seen as a linear directed graph with labeled edge and distinguished input and output vertex, e.g. a b a b c b (u) with : domain dom(u) as set of vertices, relations a dom(u) dom(u), one for every letter a A, as edge relations, and input in u and output out u dom(u).
25 Automaton : A = Q, δ, W Overlapping tile automata with a (finite) set of states Q, a transition table δ : A P(Q Q) and an acceptance pairs W Q Q. Run of A on a tile u : ρ : dom(u) Q such that, if x a y then (ρ(x), ρ(y)) δ(a) for every x, y dom(u), every a A, a b a b c b (u) q 0 q 1 q 2 q 3 q 4 q 5 q 6 with (q 0, q 1 ), (q 2, q 3 ) δ(a), (q 1, q 2 ), (q 3, q 4 ), (q 5, q 6 ) δ(b) and (q 4, q 5 ) δ(c). Accepting : (ρ(in u ), ρ(out u )) W
26 Recognized languages L(A) Tile automata languages defined as the set of (non zero) overlapping tile u such that there is a an accepting run of A on u. Remark Every language L recognized by an automaton is upward closed in the natural order and definable in MSO. Theorem (MSO ) A language of overlapping tiles L T A 0 is recognized by a finite state tile automaton if and only if L is definable in MSO and upward closed. Corollary This class of languages if closed under union, intersection, projection, inverse, and... upward closed product or star.
27 4. Quasi-recognizability Algebras for the boolean closure of upward closed MSO definable languages
28 Induced premorphism Towards an associated algebra Let A = Q, δ,, W be an automaton and let ϕ : T A P(Q Q) be the mapping defined by ϕ(0) = and, for every non zero tile u. Lemma ϕ(u) = {(ρ(in u ), ρ(out u )) Q Q : run ρ of A on u} The mapping ϕ recognizes L(A) in the sense that L(A) = ϕ 1 (ϕ(l(a))). Remark With X P(Q Q) the language ϕ 1 (X) 0 T A is Bool f (MSO ).
29 Towards an associated algebra Lemma The sub-monoid induced by ϕ(t A ) ordered by inclusion is a partially ordered monoid. Lemma The mapping ϕ is a -premorphism, i.e. for every B and C T A : if B C then ϕ(b) ϕ(c) ϕ(b C) ϕ(b) ϕ(c) Question Find a more complete axiomatization of these ordered monoids and premorphisms?
30 Algebras for languages of overlapping tiles Definition (Adequately ordered monoid) A monoid S such that: the order is stable, i.e. for every x, y and z S, if x y then z x z y and x z x y, subunits are idempotents, i.e. for every x U(S) = {x S : x 1} we have xx = x, for every x S, both the left projection x L = min{z U(S) : x z = x} and the right projection x R = min{z U(S) : z x = x} exists (in U(S)). Examples (1) Every trivially ordered monoid with x L = x R = 1. (2) Every naturally ordered inverse monoid with x L = x 1 x and x R = xx 1. (3) Every finite partially ordered monoid with idempotent subunits.
31 Algebras for languages of overlapping tiles Definition (Adequate premorphism) A mapping ϕ : S T with S and T two adequately ordered monoids such that: ϕ is monotonic, submultiplicative with ϕ(1) = 1. ϕ preserves disjoint product, i.e. for every x and y S such that x y 0 and x L y R = 1 we have ϕ(x y) = ϕ(x) ϕ(y), ϕ preserves left and right projections, i.e. for every x S we have ϕ(x L ) = (ϕ(x)) L and ϕ(x R ) = (ϕ(x)) R. Example The canonical mapping ϕ : T A P(Q Q) induced by an automaton A.
32 Quasi-recognizable languages Definition A language L T A is quasi-recognizable (QREC) when there exists a finite adequately ordered monoid S and an adequate premorphism ϕ : T A S such that L = ϕ 1 (ϕ(l)). Lemma (Effectiveness) Let ϕ : T A S be an adequate premorphism with finite S. For every B T A, the image ϕ(b) of B is computable in linear time in B. Proof. Thanks to some canonical disjoint decomposition property.
33 Expressiveness of QREC Theorem A language L is QREC if and only if L is a finite boolean combination of languages recog. by finite state automata, i.e. QREC=BOOL(MSO ). proof. (QREC) MSO : simulate disjoint decomposition. (QREC + MSO) BOOL(MSO ) : let ϕ : T A S an adequate premorphism with finite S. For every x S we have: ϕ 1 (x) = ϕ 1 (y) ϕ 1 (y) y x } y x {{}} {{} MSO MSO
34 Expressiveness of QREC proof (continued). BOOL(MSO ) QREC : since MSO QREC and QREC is closed under complement, it suffices to prove closure under union. Let ϕ 1 : T A S 1 and ϕ 2 : T A S 1 two adequate premorphisms with finite S 1 and S 2. Then S 1 S 2 is adequately ordered and ϕ = ϕ 1, ϕ 2 : T A S 1 S 2 recognizes the union of any languages L 1 and L 2 resp. recognized by ϕ 1 and ϕ 2.
35 5. Beyond automata Where we eventually show that QREC is strictly included in MSO (this result is obtained after the presentation, following Marc Zeitoun remark)
36 BOOL(MSO ) vs MSO Theorem There are MSO definable languages of tiles that are not QREC henceforth, equivalently, not BOOL(MSO ). Proof. Take u n = (1, a n, 1), e n = u n un 1 and L = {e 2n : n ω}. (e 0 L) (e 1 L) a (e 2 L) aa (e 3 L) aaa (e 4 L) aaaa etc...
37 6. Conclusion
38 Works in progress QREC and languages of finite trees [1]. Tile programming [2]. Musical tiles [3] Syntactic adequately ordered monoid? Birooted infinite words or even trees?
39 [1] D. Janin. Algebras, automata and logic for languages of labeled birooted trees. In Int. Col. on Aut., Lang. and Programming (ICALP), volume 7966 of LNCS, pages Springer, [2] D. Janin, F. Berthaut, M. DeSainte-Catherine, Y. Orlarey, and S. Salvati. The T-calculus : towards a structured programming of (musical) time and space. Technical Report RR , LaBRI, Université de Bordeaux, [3] D. Janin, F. Berthaut, and M. DeSainteCatherine. Multi-scale design of interactive music systems : the libtuiles experiment. In Sound and Music Computing (SMC), [4] M. V. Lawson. Inverse Semigroups : The theory of partial symmetries.
40 World Scientific, [5] M. V. Lawson. McAlister semigroups. Journal of Algebra, 202(1): , [6] M. Pietrich. Inverse semigroups. Wiley, 1984.
Alternating nonzero automata
Alternating nonzero automata Application to the satisfiability of CTL [,, P >0, P =1 ] Hugo Gimbert, joint work with Paulin Fournier LaBRI, Université de Bordeaux ANR Stoch-MC 06/07/2017 Control and verification
More informationTwo-way automata and regular languages of overlapping tiles
Two-way automata and regular languages of overlapping tiles Anne Dicky, David Janin To cite this version: Anne Dicky, David Janin. Two-way automata and regular languages of overlapping tiles. Fundamenta
More informationAperiodic languages p. 1/34. Aperiodic languages. Verimag, Grenoble
Aperiodic languages p. 1/34 Aperiodic languages Dejan Ničković Verimag, Grenoble Aperiodic languages p. 2/34 Table of Contents Introduction Aperiodic Sets Star-Free Regular Sets Schützenberger s theorem
More informationThe wreath product principle for ordered semigroups
The wreath product principle for ordered semigroups Jean-Eric Pin, Pascal Weil To cite this version: Jean-Eric Pin, Pascal Weil. The wreath product principle for ordered semigroups. Communications in Algebra,
More informationSEPARATING REGULAR LANGUAGES WITH FIRST-ORDER LOGIC
Logical Methods in Computer Science Vol. 12(1:5)2016, pp. 1 30 www.lmcs-online.org Submitted Jun. 4, 2014 Published Mar. 9, 2016 SEPARATING REGULAR LANGUAGES WITH FIRST-ORDER LOGIC THOMAS PLACE AND MARC
More informationThe theory of regular cost functions.
The theory of regular cost functions. Denis Kuperberg PhD under supervision of Thomas Colcombet Hebrew University of Jerusalem ERC Workshop on Quantitative Formal Methods Jerusalem, 10-05-2013 1 / 30 Introduction
More informationDuality in Logic. Duality in Logic. Lecture 2. Mai Gehrke. Université Paris 7 and CNRS. {ε} A ((ab) (ba) ) (ab) + (ba) +
Lecture 2 Mai Gehrke Université Paris 7 and CNRS A {ε} A ((ab) (ba) ) (ab) + (ba) + Further examples - revisited 1. Completeness of modal logic with respect to Kripke semantics was obtained via duality
More informationLanguages, logics and automata
Languages, logics and automata Anca Muscholl LaBRI, Bordeaux, France EWM summer school, Leiden 2011 1 / 89 Before all that.. Sonia Kowalewskaya Emmy Noether Julia Robinson All this attention has been gratifying
More informationBüchi Automata and their closure properties. - Ajith S and Ankit Kumar
Büchi Automata and their closure properties - Ajith S and Ankit Kumar Motivation Conventional programs accept input, compute, output result, then terminate Reactive program : not expected to terminate
More informationGEETANJALI INSTITUTE OF TECHNICAL STUDIES, UDAIPUR I
GEETANJALI INSTITUTE OF TECHNICAL STUDIES, UDAIPUR I Internal Examination 2017-18 B.Tech III Year VI Semester Sub: Theory of Computation (6CS3A) Time: 1 Hour 30 min. Max Marks: 40 Note: Attempt all three
More informationCHURCH SYNTHESIS PROBLEM and GAMES
p. 1/? CHURCH SYNTHESIS PROBLEM and GAMES Alexander Rabinovich Tel-Aviv University, Israel http://www.tau.ac.il/ rabinoa p. 2/? Plan of the Course 1. The Church problem - logic and automata. 2. Games -
More informationAxioms of Kleene Algebra
Introduction to Kleene Algebra Lecture 2 CS786 Spring 2004 January 28, 2004 Axioms of Kleene Algebra In this lecture we give the formal definition of a Kleene algebra and derive some basic consequences.
More informationVarieties Generated by Certain Models of Reversible Finite Automata
Varieties Generated by Certain Models of Reversible Finite Automata Marats Golovkins 1 and Jean-Eric Pin 2 1 Institute of Mathematics and Computer Science, University of Latvia, Raiņa bulv. 29, Riga, Latvia
More informationApproaches to tiling semigroups
Nick Gilbert Heriot-Watt University, Edinburgh (joint work with Erzsi Dombi) Periodic tilings Non-periodic tilings Ulrich Kortenkamp: Paving the Alexanderplatz Tilings of R n A tile in R n is a connected
More informationBüchi Automata and Their Determinization
Büchi Automata and Their Determinization Edinburgh, October 215 Plan of the Day 1. Büchi automata and their determinization 2. Infinite games 3. Rabin s Tree Theorem 4. Decidability of monadic theories
More informationFINITE MEMORY DETERMINACY
p. 1/? FINITE MEMORY DETERMINACY Alexander Rabinovich Department of Computer Science Tel-Aviv University p. 2/? Plan 1. Finite Memory Strategies. 2. Finite Memory Determinacy of Muller games. 3. Latest
More informationQuasi-Weak Cost Automata
Quasi-Weak Cost Automata A New Variant of Weakness Denis Kuperberg 1 Michael Vanden Boom 2 1 LIAFA/CNRS/Université Paris 7, Denis Diderot, France 2 Department of Computer Science, University of Oxford,
More informationCharacterizing CTL-like logics on finite trees
Theoretical Computer Science 356 (2006) 136 152 www.elsevier.com/locate/tcs Characterizing CTL-like logics on finite trees Zoltán Ésik 1 Department of Computer Science, University of Szeged, Hungary Research
More informationHierarchy among Automata on Linear Orderings
Hierarchy among Automata on Linear Orderings Véronique Bruyère Institut d Informatique Université de Mons-Hainaut Olivier Carton LIAFA Université Paris 7 Abstract In a preceding paper, automata and rational
More informationVarieties Generated by Certain Models of Reversible Finite Automata
Varieties Generated by Certain Models of Reversible Finite Automata Marats Golovkins Faculty of Computing, University of Latvia, Raiņa bulv. 29, Riga LV-1459, Latvia marats at latnet dot lv Jean-Eric Pin
More informationOn the bisimulation invariant fragment of monadic Σ 1 in the finite
On the bisimulation invariant fragment of monadic Σ 1 in the finite Anuj Dawar 1 and David Janin 2 1 University of Cambridge Computer Laboratory, Cambridge CB3 0FD, UK, anuj.dawar@cl.cam.ac.uk. 2 LaBRI,
More informationAlgebraic Approach to Automata Theory
Algebraic Approach to Automata Theory Deepak D Souza Department of Computer Science and Automation Indian Institute of Science, Bangalore. 20 September 2016 Outline 1 Overview 2 Recognition via monoid
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 informationPolynomial closure and unambiguous product
Polynomial closure and unambiguous product Jean-Eric Pin and Pascal Weil pin@litp.ibp.fr, weil@litp.ibp.fr 1 Introduction This paper is a contribution to the algebraic theory of recognizable languages,
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 informationTree Automata and Rewriting
and Rewriting Ralf Treinen Université Paris Diderot UFR Informatique Laboratoire Preuves, Programmes et Systèmes treinen@pps.jussieu.fr July 23, 2010 What are? Definition Tree Automaton A tree automaton
More informationValence automata over E-unitary inverse semigroups
Valence automata over E-unitary inverse semigroups Erzsi Dombi 30 May 2018 Outline Motivation Notation and introduction Valence automata Bicyclic and polycyclic monoids Motivation Chomsky-Schützenberger
More informationLogic and Automata I. Wolfgang Thomas. EATCS School, Telc, July 2014
Logic and Automata I EATCS School, Telc, July 2014 The Plan We present automata theory as a tool to make logic effective. Four parts: 1. Some history 2. Automata on infinite words First step: MSO-logic
More informationAn Overview of Residuated Kleene Algebras and Lattices Peter Jipsen Chapman University, California. 2. Background: Semirings and Kleene algebras
An Overview of Residuated Kleene Algebras and Lattices Peter Jipsen Chapman University, California 1. Residuated Lattices with iteration 2. Background: Semirings and Kleene algebras 3. A Gentzen system
More informationFrom Monadic Second-Order Definable String Transformations to Transducers
From Monadic Second-Order Definable String Transformations to Transducers Rajeev Alur 1 Antoine Durand-Gasselin 2 Ashutosh Trivedi 3 1 University of Pennsylvania 2 LIAFA, Université Paris Diderot 3 Indian
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 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 informationA robust class of regular languages
A robust class of regular languages Antonio Cano Gómez 1 and Jean-Éric Pin2 1 Departamento de Sistemas Informáticos y Computación, Universidad Politécnica de Valencia, Camino de Vera s/n, P.O. Box: 22012,
More information1. Propositional Calculus
1. Propositional Calculus Some notes for Math 601, Fall 2010 based on Elliott Mendelson, Introduction to Mathematical Logic, Fifth edition, 2010, Chapman & Hall. 2. Syntax ( grammar ). 1.1, p. 1. Given:
More informationFiniteness conditions and index in semigroup theory
Finiteness conditions and index in semigroup theory Robert Gray University of Leeds Leeds, January 2007 Robert Gray (University of Leeds) 1 / 39 Outline 1 Motivation and background Finiteness conditions
More informationgroup Jean-Eric Pin and Christophe Reutenauer
A conjecture on the Hall topology for the free group Jean-Eric Pin and Christophe Reutenauer Abstract The Hall topology for the free group is the coarsest topology such that every group morphism from the
More informationProfinite methods in automata theory
Profinite methods in automata theory Jean-Éric Pin1 1 LIAFA, CNRS and Université Paris Diderot STACS 2009, Freiburg, Germany supported by the ESF network AutoMathA (European Science Foundation) Summary
More informationAperiodic String Transducers
Aperiodic String Transducers Luc Dartois, Ismaël Jecker Université Libre de Bruxelles, Belgium Pierre-Alain Reynier Aix Marseille Univ, Université de Toulon, CNRS, LIS, Marseille, France Regular string-to-string
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 informationOn Recognizable Languages of Infinite Pictures
On Recognizable Languages of Infinite Pictures Equipe de Logique Mathématique CNRS and Université Paris 7 LIF, Marseille, Avril 2009 Pictures Pictures are two-dimensional words. Let Σ be a finite alphabet
More informationAdequate and Ehresmann semigroups
Adequate and Ehresmann semigroups NSAC2013: June 8th, 2013, Novi Sad Victoria Gould University of York What is this talk about? Classes of semigroups with semilattices of idempotents inverse ample adequate
More informationOn Recognizable Languages of Infinite Pictures
On Recognizable Languages of Infinite Pictures Equipe de Logique Mathématique CNRS and Université Paris 7 JAF 28, Fontainebleau, Juin 2009 Pictures Pictures are two-dimensional words. Let Σ be a finite
More information1. Propositional Calculus
1. Propositional Calculus Some notes for Math 601, Fall 2010 based on Elliott Mendelson, Introduction to Mathematical Logic, Fifth edition, 2010, Chapman & Hall. 2. Syntax ( grammar ). 1.1, p. 1. Given:
More informationCS 133 : Automata Theory and Computability
CS 133 : Automata Theory and Computability Lecture Slides 1 Regular Languages and Finite Automata Nestine Hope S. Hernandez Algorithms and Complexity Laboratory Department of Computer Science University
More informationDuality and Automata Theory
Duality and Automata Theory Mai Gehrke Université Paris VII and CNRS Joint work with Serge Grigorieff and Jean-Éric Pin Elements of automata theory A finite automaton a 1 2 b b a 3 a, b The states are
More informationLanguages and monoids with disjunctive identity
Languages and monoids with disjunctive identity Lila Kari and Gabriel Thierrin Department of Mathematics, University of Western Ontario London, Ontario, N6A 5B7 Canada Abstract We show that the syntactic
More informationFORMAL LANGUAGES, AUTOMATA AND COMPUTABILITY
15-453 FORMAL LANGUAGES, AUTOMATA AND COMPUTABILITY REVIEW for MIDTERM 1 THURSDAY Feb 6 Midterm 1 will cover everything we have seen so far The PROBLEMS will be from Sipser, Chapters 1, 2, 3 It will be
More informationCSE 105 Homework 1 Due: Monday October 9, Instructions. should be on each page of the submission.
CSE 5 Homework Due: Monday October 9, 7 Instructions Upload a single file to Gradescope for each group. should be on each page of the submission. All group members names and PIDs Your assignments in this
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 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 informationTAFL 1 (ECS-403) Unit- II. 2.1 Regular Expression: The Operators of Regular Expressions: Building Regular Expressions
TAFL 1 (ECS-403) Unit- II 2.1 Regular Expression: 2.1.1 The Operators of Regular Expressions: 2.1.2 Building Regular Expressions 2.1.3 Precedence of Regular-Expression Operators 2.1.4 Algebraic laws for
More informationSemigroup presentations via boundaries in Cayley graphs 1
Semigroup presentations via boundaries in Cayley graphs 1 Robert Gray University of Leeds BMC, Newcastle 2006 1 (Research conducted while I was a research student at the University of St Andrews, under
More informationCS 154. Finite Automata vs Regular Expressions, Non-Regular Languages
CS 154 Finite Automata vs Regular Expressions, Non-Regular Languages Deterministic Finite Automata Computation with finite memory Non-Deterministic Finite Automata Computation with finite memory and guessing
More informationA Note on Decidable Separability by Piecewise Testable Languages
A Note on Decidable Separability by Piecewise Testable Languages Wojciech Czerwiński 1, Wim Martens 2, Lorijn van Rooijen 3, and Marc Zeitoun 3 1 University of Warsaw 2 University of Bayreuth 3 Bordeaux
More informationResearch Statement. MUHAMMAD INAM 1 of 5
MUHAMMAD INAM 1 of 5 Research Statement Preliminaries My primary research interests are in geometric inverse semigroup theory and its connections with other fields of mathematics. A semigroup M is called
More informationChapter 3. Regular grammars
Chapter 3 Regular grammars 59 3.1 Introduction Other view of the concept of language: not the formalization of the notion of effective procedure, but set of words satisfying a given set of rules Origin
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 informationTree languages defined in first-order logic with one quantifier alternation
Tree languages defined in first-order logic with one quantifier alternation Miko laj Bojańczyk, Luc Segoufin Warsaw University, INRIA - LSV March 9, 2010 Abstract We study tree languages that can be defined
More informationMonadic Second Order Logic and Automata on Infinite Words: Büchi s Theorem
Monadic Second Order Logic and Automata on Infinite Words: Büchi s Theorem R. Dustin Wehr December 18, 2007 Büchi s theorem establishes the equivalence of the satisfiability relation for monadic second-order
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 informationlanguages by semifilter-congruences
ideas Suffix semifilter-congruences Southwest Univ. Southwest Univ. Hongkong Univ. July 5 9, 2010, Nankai, China. Prefixsuffix Contents ideas 1 2 ideas 3 Suffix- 4 Prefix-suffix- Suffix Prefixsuffix ideas
More informationUnit 6. Non Regular Languages The Pumping Lemma. Reading: Sipser, chapter 1
Unit 6 Non Regular Languages The Pumping Lemma Reading: Sipser, chapter 1 1 Are all languages regular? No! Most of the languages are not regular! Why? A finite automaton has limited memory. How can we
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 informationCERNY CONJECTURE FOR DFA ACCEPTING STAR-FREE LANGUAGES
CERNY CONJECTURE FOR DFA ACCEPTING STAR-FREE LANGUAGES A.N. Trahtman? Bar-Ilan University, Dep. of Math. and St., 52900, Ramat Gan, Israel ICALP, Workshop synchr. autom., Turku, Finland, 2004 Abstract.
More informationNon-emptiness Testing for TMs
180 5. Reducibility The proof of unsolvability of the halting problem is an example of a reduction: a way of converting problem A to problem B in such a way that a solution to problem B can be used to
More informationDefinition of Büchi Automata
Büchi Automata Definition of Büchi Automata Let Σ = {a,b,...} be a finite alphabet. By Σ ω we denote the set of all infinite words over Σ. A non-deterministic Büchi automaton (NBA) over Σ is a tuple A
More informationA Model Theoretic Proof of Completeness of an Axiomatization of Monadic Second-Order Logic on Infinite Words
A Model Theoretic Proof of Completeness of an Axiomatization of Monadic Second-Order Logic on Infinite Words Colin Riba ENS de Lyon, Université de Lyon, LIP colin.riba@ens-lyon.fr http://perso.ens-lyon.fr/colin.riba/
More informationWarshall s algorithm
Regular Expressions [1] Warshall s algorithm See Floyd-Warshall algorithm on Wikipedia The Floyd-Warshall algorithm is a graph analysis algorithm for finding shortest paths in a weigthed, directed graph
More informationAlgebras with finite descriptions
Algebras with finite descriptions André Nies The University of Auckland July 19, 2005 Part 1: FA-presentability A countable structure in a finite signature is finite-automaton presentable (or automatic)
More informationCS 121, Section 2. Week of September 16, 2013
CS 121, Section 2 Week of September 16, 2013 1 Concept Review 1.1 Overview In the past weeks, we have examined the finite automaton, a simple computational model with limited memory. We proved that DFAs,
More informationA Weak Bisimulation for Weighted Automata
Weak Bisimulation for Weighted utomata Peter Kemper College of William and Mary Weighted utomata and Semirings here focus on commutative & idempotent semirings Weak Bisimulation Composition operators Congruence
More informationSubstitutions, Rauzy fractals and Tilings
Substitutions, Rauzy fractals and Tilings Anne Siegel CANT, 2009 Reminder... Pisot fractals: projection of the stair of a Pisot substitution Self-replicating substitution multiple tiling: replace faces
More informationModal Logic XIII. Yanjing Wang
Modal Logic XIII Yanjing Wang Department of Philosophy, Peking University Apr 16th, 2015 Advanced Modal Logic (2015 Spring) 1 Frames Frames and validity Why do we study frames? Frames as tools for analysing
More informationFrom out-of-time design to in-time production of temporal media
From out-of-time design to in-time production of temporal media Paul Hudak Department of Computer Science Yale University New Haven, CT 06520 David Janin LaBRI, Bordeaux INP, Université de Bordeaux F-33405
More information1 Alphabets and Languages
1 Alphabets and Languages Look at handout 1 (inference rules for sets) and use the rules on some examples like {a} {{a}} {a} {a, b}, {a} {{a}}, {a} {{a}}, {a} {a, b}, a {{a}}, a {a, b}, a {{a}}, a {a,
More informationWeak Cost Monadic Logic over Infinite Trees
Weak Cost Monadic Logic over Infinite Trees Michael Vanden Boom Department of Computer Science University of Oxford MFCS 011 Warsaw Cost monadic second-order logic (cost MSO) Syntax First-order logic with
More informationLogical Characterization of Weighted Pebble Walking Automata
Logical Characterization of Weighted Pebble Walking Automata Benjamin Monmege Université libre de Bruxelles, Belgium Benedikt Bollig and Paul Gastin (LSV, ENS Cachan, France) Marc Zeitoun (LaBRI, Bordeaux
More informationRational graphs trace context-sensitive languages
Rational graphs trace context-sensitive languages Christophe Morvan 1 and Colin Stirling 2 1 IRISA, Campus de eaulieu, 35042 Rennes, France christophe.morvan@irisa.fr 2 Division of Informatics, University
More informationRegular Expressions [1] Regular Expressions. Regular expressions can be seen as a system of notations for denoting ɛ-nfa
Regular Expressions [1] Regular Expressions Regular expressions can be seen as a system of notations for denoting ɛ-nfa They form an algebraic representation of ɛ-nfa algebraic : expressions with equations
More informationAutomata, Logic and Games: Theory and Application
Automata, Logic and Games: Theory and Application 1. Büchi Automata and S1S Luke Ong University of Oxford TACL Summer School University of Salerno, 14-19 June 2015 Luke Ong Büchi Automata & S1S 14-19 June
More informationRegular Languages. Problem Characterize those Languages recognized by Finite Automata.
Regular Expressions Regular Languages Fundamental Question -- Cardinality Alphabet = Σ is finite Strings = Σ is countable Languages = P(Σ ) is uncountable # Finite Automata is countable -- Q Σ +1 transition
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 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 informationChapter Summary. Sets The Language of Sets Set Operations Set Identities Functions Types of Functions Operations on Functions Computability
Chapter 2 1 Chapter Summary Sets The Language of Sets Set Operations Set Identities Functions Types of Functions Operations on Functions Computability Sequences and Summations Types of Sequences Summation
More informationMonoidal Categories, Bialgebras, and Automata
Monoidal Categories, Bialgebras, and Automata James Worthington Mathematics Department Cornell University Binghamton University Geometry/Topology Seminar October 29, 2009 Background: Automata Finite automata
More informationOn closures of lexicographic star-free languages. E. Ochmański and K. Stawikowska
On closures of lexicographic star-free languages E. Ochmański and K. Stawikowska Preprint No 7/2005 Version 1, posted on April 19, 2005 On closures of lexicographic star-free languages Edward Ochma ski
More informationPartially Ordered Two-way Büchi Automata
Partially Ordered Two-way Büchi Automata Manfred Kufleitner Alexander Lauser FMI, Universität Stuttgart, Germany {kufleitner, lauser}@fmi.uni-stuttgart.de June 14, 2010 Abstract We introduce partially
More informationFinite Automata Part Two
Finite Automata Part Two DFAs A DFA is a Deterministic Finite Automaton A DFA is defined relative to some alphabet Σ. For each state in the DFA, there must be exactly one transition defined for each symbol
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 informationPositive varieties and infinite words
Positive varieties and infinite words Jean-Eric Pin To cite this version: Jean-Eric Pin. Positive varieties and infinite words. 1998, Springer, Berlin, pp.76-87, 1998, Lecture Notes in Comput. Sci. 1380.
More informationAutomata-Theoretic LTL Model-Checking
Automata-Theoretic LTL Model-Checking Arie Gurfinkel arie@cmu.edu SEI/CMU Automata-Theoretic LTL Model-Checking p.1 LTL - Linear Time Logic (Pn 77) Determines Patterns on Infinite Traces Atomic Propositions
More informationAuthor: Vivek Kulkarni ( )
Author: Vivek Kulkarni ( vivek_kulkarni@yahoo.com ) Chapter-3: Regular Expressions Solutions for Review Questions @ Oxford University Press 2013. All rights reserved. 1 Q.1 Define the following and give
More informationComplementation of rational sets on countable scattered linear orderings
Complementation of rational sets on countable scattered linear orderings Chloé Rispal IGM, Université de Marne-la-Vallée, http://www-igm.univ-mlv.fr/~rispal/ Olivier Carton LIAFA, Université Paris 7, http://www.liafa.jussieu.fr/~carton/
More informationComputation Histories
208 Computation Histories The computation history for a Turing machine on an input is simply the sequence of configurations that the machine goes through as it processes the input. An accepting computation
More informationUniformization in Automata Theory
Uniformization in Automata Theory Arnaud Carayol Laboratoire d Informatique Gaspard Monge, Université Paris-Est & CNRS arnaud.carayol@univ-mlv.fr Christof Löding RWTH Aachen, Informatik 7, Aachen, Germany
More informationThe bideterministic concatenation product
The bideterministic concatenation product Jean-Eric Pin and Denis Thérien Bull Research and Development, Rue Jean-Jaurès, 78340 Les Clayes-sous-Bois, France Abstract This paper is devoted to the study
More informationF -inverse covers of E-unitary inverse monoids
F -inverse covers of E-unitary inverse monoids Outline of Ph.D. thesis Nóra Szakács Supervisor: Mária B. Szendrei Doctoral School of Mathematics and Computer Science University of Szeged 2016 1 1 Introduction
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 informationA Discrete Duality Between Nonmonotonic Consequence Relations and Convex Geometries
A Discrete Duality Between Nonmonotonic Consequence Relations and Convex Geometries Johannes Marti and Riccardo Pinosio Draft from April 5, 2018 Abstract In this paper we present a duality between nonmonotonic
More informationComputational Theory
Computational Theory Finite Automata and Regular Languages Curtis Larsen Dixie State University Computing and Design Fall 2018 Adapted from notes by Russ Ross Adapted from notes by Harry Lewis Curtis Larsen
More information