On the Accepting Power of 2-Tape Büchi Automata
|
|
- Berenice Ann Dawson
- 6 years ago
- Views:
Transcription
1 On the Accepting Power of 2-Tape Büchi Automata Equipe de Logique Mathématique Université Paris 7 STACS 2006
2 Acceptance of infinite words In the sixties, Acceptance of infinite words by finite automata was firstly considered by Büchi in order to study the decidability of the monadic second order theory S1S of one successor over the integers. Since then ω-regular languages accepted by Büchi automata and their extensions have been much studied and used for specification and verification of non terminating systems.
3 Büchi acceptance condition An automaton A reading infinite words over the alphabet Σ is equipped with a finite set of states K and a set of final states F K. A run of A reading an infinite word σ Σ ω is said to be accepting iff there is some state q f F appearing infinitely often during the reading of σ. An infinite word σ Σ ω is accepted by A if there is (at least ) one accepting run of A on σ.
4 Muller acceptance condition An automaton A reading infinite words over the alphabet Σ is equipped with a finite set of states K and a set of accepting sets of states F 2 K. A run of A reading an infinite word σ Σ ω is said to be accepting iff the set of states appearing infinitely often during this run is an accepting set F F. An infinite word σ Σ ω is accepted by A if there is (at least ) one accepting run of A on σ.
5 Context free ω-languages ( Cohen and Gold 1977; Linna 1976 ) Let L Σ ω. Then the following propositions are equivalent : L is accepted by a Büchi pushdown automaton. L is accepted by a Muller pushdown automaton. L = 1 i n U i.v ω i, for some context free finitary languages U i and V i. L is a context free ω-language. A similar theorem holds if we omit the pushdown stack and replace context free by regular.
6 Languages of infinite words An ω-language over the alphabet Σ is a subset of Σ ω. An ω-language is regular iff it is accepted by a Büchi automaton. An ω-language is context free iff it is accepted by a Büchi pushdown automaton. A 1-counter ω-language is an ω-language which is accepted by a 1-counter Büchi automaton.
7 Infinitary rational relations ( Gire 1981, Gire and Nivat 1984 ) A set R Σ ω Γ ω is an infinitary rational relation iff one the two following equivalent conditions holds : R is recognized by a Büchi transducer T : R is the set of pairs (u, v) Σ ω Γ ω such that u is the input word and v is the output word of a successful computation of T. R is accepted by a 2-tape Büchi automaton A with two asynchronous reading heads.
8 Infinitary rational relations A set R Σ ω Γ ω is an infinitary rational relation iff it is generated from : the empty set, and singletons {(a, λ)}, {(λ, b)}, a Σ, b Γ, where λ is the empty word. by operations of finite union, concatenation product : (u 1, v 1 ) (u 2, v 2 ) = (u 1 u 2, v 1 v 2 ) star operation, operation R R ω over finitary rational relations. Notice that an infinitary rational relation R Σ ω Γ ω may be seen as an ω-language R (Σ Γ) ω over the alphabet Σ Γ.
9 Topology on Σ ω The natural prefix metric on the set Σ ω of ω-words over Σ is defined as follows: For u, v Σ ω and u v let δ(u, v) = 2 n where n is the least integer such that: the (n + 1) st letter of u is different from the (n + 1) st letter of v. This metric induces on Σ ω the usual Cantor topology for which : open subsets of Σ ω are in the form W.Σ ω, where W Σ. closed subsets of Σ ω are complements of open subsets of Σ ω.
10 Borel Hierarchy Σ 0 1 is the class of open subsets of Σω, Π 0 1 is the class of closed subsets of Σω, for any integer n 1: Σ 0 n+1 is the class of countable unions of Π0 n-subsets of Σ ω. Π 0 n+1 is the class of countable intersections of Σ0 n-subsets of Σ ω. Π 0 n+1 is also the class of complements of Σ0 n+1 -subsets of Σω.
11 Borel Hierarchy The Borel hierarchy is also defined for levels indexed by countable ordinals. For any countable ordinal α 2: Σ 0 α is the class of countable unions of subsets of Σ ω in γ<α Π0 γ. Π 0 α is the class of complements of Σ 0 α-sets 0 α=π 0 α Σ 0 α.
12 Borel Hierarchy Below an arrow represents a strict inclusion between Borel classes. Π 0 1 Π 0 α Π 0 α α 0 α+1 Σ 0 1 Σ 0 α Σ 0 α+1 A set X Σ ω is a Borel set iff it is in α<ω 1 Σ 0 α = α<ω 1 Π 0 α where ω 1 is the first uncountable ordinal.
13 Beyond the Borel hierarchy There are some subsets of Σ ω which are not Borel. Beyond the Borel hierarchy is the projective hierarchy. The class of Borel subsets of Σ ω is strictly included in the class Σ 1 1 of analytic sets which are obtained by projection of Borel sets. A set E Σ ω is in the class Σ 1 1 iff : F (Σ {0, 1}) ω such that F is Π 0 2 and E is the projection of F onto Σ ω A set E Σ ω is in the class Π 1 1 iff Σω E is in Σ 1 1. Suslin s Theorem states that : Borel sets = 1 1 = Σ1 1 Π1 1
14 Complete sets A set E Σ ω is C-complete, where C is a Borel class Σ 0 α or Π 0 α or the class Σ 1 1, for reduction by continuous functions iff : F Γ ω F C iff : f continuous, f : Γ ω Σ ω such that F = f 1 (E) (x F f (x) E). Example : {σ {0, 1} ω i σ(i) = 1} is a Π 0 2 -complete-set and it is accepted by a deterministic Büchi automaton.
15 More examples of complete sets Examples : {σ {0, 1} ω i σ(i) = 1} is a Σ 0 1 -complete-set. {σ {0, 1} ω i σ(i) = 1} = {1 ω } is a Π 0 1 -complete-set. {σ {0, 1} ω < i σ(i) = 1} is a Σ 0 2 -complete-set. All these ω-languages are ω-regular.
16 Complexity of ω-languages of deterministic machines deterministic finite automata (Landweber 1969) ω-regular languages accepted by deterministic Büchi automata are Π 0 2 -sets. ω-regular languages are boolean combinations of Π 0 2 -sets hence 0 3 -sets. deterministic Turing machines ω-languages accepted by deterministic Büchi Turing machines are Π 0 2 -sets. ω-languages accepted by deterministic Muller Turing machines are boolean combinations of Π 0 2-sets hence 0 3 -sets.
17 Complexity of ω-languages of deterministic machines deterministic finite automata (Landweber 1969) ω-regular languages accepted by deterministic Büchi automata are Π 0 2 -sets. ω-regular languages are boolean combinations of Π 0 2 -sets hence 0 3 -sets. deterministic Turing machines ω-languages accepted by deterministic Büchi Turing machines are Π 0 2 -sets. ω-languages accepted by deterministic Muller Turing machines are boolean combinations of Π 0 2-sets hence 0 3 -sets.
18 Complexity of ω-languages of non deterministic Turing machines Non deterministic Büchi or Muller Turing machines accept effective analytic sets. The class Effective-Σ 1 1 of effective analytic sets is obtained as the class of projections of arithmetical sets and Effective-Σ 1 1 Σ1 1. Let ω CK 1 be the first non recursive ordinal. Topological complexity of effective analytic sets There are some Σ 1 1 -complete sets in Effective-Σ1 1. For every non null ordinal α < ω1 CK, there exists some Σ 0 α-complete and some Π 0 α-complete ω-languages in the class Effective-Σ 1 1. ( Kechris, Marker and Sami 1989) The supremum of the set of Borel ranks of Effective-Σ 1 1 -sets is a countable ordinal γ1 2 > ωck 1.
19 Topological complexity of 1-counter or context free ω-languages Let 1 CL ω be the class of real-time 1-counter ω-languages. Let C be a class of ω-languages such that: 1 CL ω C Effective-Σ 1 1. (a) (Finkel and Ressayre 2003) There are some Σ 1 1 -complete sets in the class C. (b) (Finkel 2005) The Borel hierarchy of the class C is equal to the Borel hierarchy of the class Effective-Σ 1 1. (c) γ2 1 is the supremum of the set of Borel ranks of ω-languages in the class C. (d) For every non null ordinal α < ω1 CK, there exists some Σ 0 α-complete and some Π 0 α-complete ω-languages in the class C.
20 Topological complexity of 1-counter or context free ω-languages Let 1 CL ω be the class of real-time 1-counter ω-languages. Let C be a class of ω-languages such that: 1 CL ω C Effective-Σ 1 1. (a) (Finkel and Ressayre 2003) There are some Σ 1 1 -complete sets in the class C. (b) (Finkel 2005) The Borel hierarchy of the class C is equal to the Borel hierarchy of the class Effective-Σ 1 1. (c) γ2 1 is the supremum of the set of Borel ranks of ω-languages in the class C. (d) For every non null ordinal α < ω1 CK, there exists some Σ 0 α-complete and some Π 0 α-complete ω-languages in the class C.
21 Topological complexity of 1-counter or context free ω-languages Let 1 CL ω be the class of real-time 1-counter ω-languages. Let C be a class of ω-languages such that: 1 CL ω C Effective-Σ 1 1. (a) (Finkel and Ressayre 2003) There are some Σ 1 1 -complete sets in the class C. (b) (Finkel 2005) The Borel hierarchy of the class C is equal to the Borel hierarchy of the class Effective-Σ 1 1. (c) γ2 1 is the supremum of the set of Borel ranks of ω-languages in the class C. (d) For every non null ordinal α < ω1 CK, there exists some Σ 0 α-complete and some Π 0 α-complete ω-languages in the class C.
22 Topological complexity of 1-counter or context free ω-languages Let 1 CL ω be the class of real-time 1-counter ω-languages. Let C be a class of ω-languages such that: 1 CL ω C Effective-Σ 1 1. (a) (Finkel and Ressayre 2003) There are some Σ 1 1 -complete sets in the class C. (b) (Finkel 2005) The Borel hierarchy of the class C is equal to the Borel hierarchy of the class Effective-Σ 1 1. (c) γ2 1 is the supremum of the set of Borel ranks of ω-languages in the class C. (d) For every non null ordinal α < ω1 CK, there exists some Σ 0 α-complete and some Π 0 α-complete ω-languages in the class C.
23 Topological complexity of infinitary rational relations Question : What is the topological complexity of infinitary rational relations? ( Thomas 1989, Simonnet 1992, Lescow and Thomas 1994 ) Infinitary rational relations have same topological complexity as ω-languages accepted by real-time 1-counter Büchi automata or by Büchi Turing machines (i.e. effective analytic sets).
24 Coding infinite words over Σ Let Σ be a finite alphabet such that 0 Σ and Γ = Σ {A}. An ω-word x Σ ω is coded by the ω-word h(x) Γ ω : h(x) = A.0.x(1).A.0 2.x(2).A... A.0 n.x(n).a.0 n+1.x(n + 1).A... The mapping h : Σ ω (Σ {A}) ω is continuous and injective. Let α be the ω-word over Σ {A} which is defined by: α = A.0.A.0 2.A.0 3.A.0 4.A... A.0 n.a.0 n+1.a... We consider the reading of a pair (h(x), α) by a 2-tape Büchi automaton B which can simulate the reading of x Σ ω by a real-time 1-counter Büchi automaton A.
25 Simulating a 1-counter automaton Lemma Let L Σ ω be accepted by a real-time 1-counter automaton A. Then there exists an infinitary rational relation R 1 (Σ {A}) ω (Σ {A}) ω such that: x Σ ω (x L) iff ((h(x), α) R 1 ) Lemma The set R 2 = (Σ {A}) ω (Σ {A}) ω (h(σ ω ) {α}) is an infinitary rational relation.
26 Simulating a 1-counter automaton Lemma Let L Σ ω be accepted by a real-time 1-counter automaton A. Then there exists an infinitary rational relation R 1 (Σ {A}) ω (Σ {A}) ω such that: x Σ ω (x L) iff ((h(x), α) R 1 ) Lemma The set R 2 = (Σ {A}) ω (Σ {A}) ω (h(σ ω ) {α}) is an infinitary rational relation.
27 Construction of R = R 1 R 2 The infinitary relation R = R 1 R 2 is rational and may be written as the union: R = L {α} Γ ω (Γ ω {α}) where L = h(l) (Γ ω h(σ ω )) and Γ = Σ {A}. Γ ω (Γ ω {α}) is an open subset of Γ ω Γ ω. L {α} has same complexity as h(l) so also as L. Thus R Γ ω Γ ω has same topological complexity as the 1-counter ω-language L Σ ω.
28 Topological complexity of infinitary rational relations Let RAT ω be the class of infinitary rational relations (a) There are some Σ 1 1 -complete sets in the class RAT ω. (b) The Borel hierarchy of the class RAT ω is equal to the Borel hierarchy of the class Effective-Σ 1 1. (c) γ2 1 is the supremum of the set of Borel ranks of ω-languages in the class RAT ω. (d) For every non null ordinal α < ω1 CK, there exists some Σ 0 α-complete and some Π 0 α-complete ω-languages in the class RAT ω.
29 Topological complexity of infinitary rational relations Let RAT ω be the class of infinitary rational relations (a) There are some Σ 1 1 -complete sets in the class RAT ω. (b) The Borel hierarchy of the class RAT ω is equal to the Borel hierarchy of the class Effective-Σ 1 1. (c) γ2 1 is the supremum of the set of Borel ranks of ω-languages in the class RAT ω. (d) For every non null ordinal α < ω1 CK, there exists some Σ 0 α-complete and some Π 0 α-complete ω-languages in the class RAT ω.
30 Topological complexity of infinitary rational relations Let RAT ω be the class of infinitary rational relations (a) There are some Σ 1 1 -complete sets in the class RAT ω. (b) The Borel hierarchy of the class RAT ω is equal to the Borel hierarchy of the class Effective-Σ 1 1. (c) γ2 1 is the supremum of the set of Borel ranks of ω-languages in the class RAT ω. (d) For every non null ordinal α < ω1 CK, there exists some Σ 0 α-complete and some Π 0 α-complete ω-languages in the class RAT ω.
31 Topological complexity of infinitary rational relations Let RAT ω be the class of infinitary rational relations (a) There are some Σ 1 1 -complete sets in the class RAT ω. (b) The Borel hierarchy of the class RAT ω is equal to the Borel hierarchy of the class Effective-Σ 1 1. (c) γ2 1 is the supremum of the set of Borel ranks of ω-languages in the class RAT ω. (d) For every non null ordinal α < ω1 CK, there exists some Σ 0 α-complete and some Π 0 α-complete ω-languages in the class RAT ω.
32 A refinement of the Borel hierarchy: the Wadge hierarchy The Wadge hierarchy of the class RAT ω and the Wadge hierarchy of the class 1 CL ω are equal. Thus the Wadge hierarchy of the class RAT ω is also the Wadge hierarchy of the class Effective-Σ 1 1 of ω-languages accepted by Turing machines with a Büchi acceptance condition.
On 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 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 informationarxiv: v2 [cs.lo] 26 Mar 2018
Wadge Degrees of ω-languages of Petri Nets Olivier Finkel Equipe de Logique Mathématique Institut de Mathématiques de Jussieu - Paris Rive Gauche CNRS et Université Paris 7, France. finkel@math.univ-paris-diderot.fr
More informationLocally Finite ω-languages and Effective Analytic Sets Have the Same Topological Complexity
Locally Finite ω-languages and Effective Analytic Sets Have the Same Topological Complexity Olivier Finkel To cite this version: Olivier Finkel. Locally Finite ω-languages and Effective Analytic Sets Have
More informationIncompleteness Theorems, Large Cardinals, and Automata ov
Incompleteness Theorems, Large Cardinals, and Automata over Finite Words Equipe de Logique Mathématique Institut de Mathématiques de Jussieu - Paris Rive Gauche CNRS and Université Paris 7 TAMC 2017, Berne
More informationWADGE HIERARCHY OF OMEGA CONTEXT FREE LANGUAGES
WADGE HIERARCHY OF OMEGA CONTEXT FREE LANGUAGES Olivier Finkel Equipe de Logique Mathématique CNRS URA 753 et Université Paris 7 U.F.R. de Mathématiques 2 Place Jussieu 75251 Paris cedex 05, France. E
More informationAMBIGUITY IN OMEGA CONTEXT FREE LANGUAGES
AMBIGUITY IN OMEGA CONTEXT FREE LANGUAGES Olivier Finkel Equipe de Logique Mathématique CNRS et Université Paris 7, U.F.R. de Mathématiques 2 Place Jussieu 75251 Paris cedex 05, France. Abstract We extend
More informationarxiv: v1 [math.lo] 10 Sep 2018
An Effective Property of ω-rational Functions Olivier Finkel arxiv:1809.03220v1 [math.lo] 10 Sep 2018 Institut de Mathématiques de Jussieu - Paris Rive Gauche CNRS et Université Paris 7, France. Olivier.Finkel@math.univ-paris-diderot.fr
More informationTHE COMPLEXITY OF INFINITE COMPUTATIONS IN MODELS OF SET THEORY
Logical Methods in Computer Science Vol. 5 (4:4) 2009, pp. 1 18 www.lmcs-online.org Submitted Jan. 20, 2009 Published Dec. 21, 2009 THE COMPLEXITY OF INFINITE COMPUTATIONS IN MODELS OF SET THEORY OLIVIER
More informationTopological Properties of Omega Context Free Languages
Topological Properties of Omega Context Free Languages Olivier Finkel To cite this version: Olivier Finkel. Topological Properties of Omega Context Free Languages. Theoretical Computer Science, Elsevier,
More informationAmbiguity of ω-languages of Turing Machines
Ambiguity of ω-languages of Turing Machines Olivier Finkel To cite this version: Olivier Finkel. Ambiguity of ω-languages of Turing Machines. Logical Methods in Computer Science, Logical Methods in Computer
More informationThe exact complexity of the infinite Post Correspondence Problem
The exact complexity of the infinite Post Correspondence Problem Olivier Finkel To cite this version: Olivier Finkel. The exact complexity of the infinite Post Correspondence Problem. Information Processing
More informationOn the Continuity Set of an omega Rational Function
On the Continuity Set of an omega Rational Function Olivier Carton, Olivier Finkel, Pierre Simonnet To cite this version: Olivier Carton, Olivier Finkel, Pierre Simonnet. On the Continuity Set of an omega
More informationOn decision problems for timed automata
On decision problems for timed automata Olivier Finkel Equipe de Logique Mathématique, U.F.R. de Mathématiques, Université Paris 7 2 Place Jussieu 75251 Paris cedex 05, France. finkel@logique.jussieu.fr
More informationAmbiguity of omega-languages of Turing Machines
Ambiguity of omega-languages of Turing Machines Olivier Finkel To cite this version: Olivier Finkel. Ambiguity of omega-languages of Turing Machines. 2012. HAL Id: hal-00735050 https://hal.archives-ouvertes.fr/hal-00735050v1
More informationOn Recognizable Tree Languages Beyond the Borel Hierarchy
On Recognizable Tree Languages Beyond the Borel Hierarchy Olivier Finkel, Pierre Simonnet To cite this version: Olivier Finkel, Pierre Simonnet. On Recognizable Tree Languages Beyond the Borel Hierarchy.
More informationDM17. Beregnelighed. Jacob Aae Mikkelsen
DM17 Beregnelighed Jacob Aae Mikkelsen January 12, 2007 CONTENTS Contents 1 Introduction 2 1.1 Operations with languages...................... 2 2 Finite Automata 3 2.1 Regular expressions/languages....................
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 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 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 informationComplexity of infinite tree languages
Complexity of infinite tree languages when automata meet topology Damian Niwiński University of Warsaw joint work with André Arnold, Szczepan Hummel, and Henryk Michalewski Liverpool, October 2010 1 Example
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 informationOn the complexity of infinite computations
On the complexity of infinite computations Damian Niwiński, Warsaw University joint work with Igor Walukiewicz and Filip Murlak Newton Institute, Cambridge, June 2006 1 Infinite computations Büchi (1960)
More informationTopological properties ofomega context-free languages
Theoretical Computer Science 262 (2001) 669 697 www.elsevier.com/locate/tcs Topological properties ofomega context-free languages Olivier Finkel Equipe de Logique Mathematique, CNRS URA 753 et Universite
More informationAutomata on linear orderings
Automata on linear orderings Véronique Bruyère Institut d Informatique Université de Mons-Hainaut Olivier Carton LIAFA Université Paris 7 September 25, 2006 Abstract We consider words indexed by linear
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 informationPart I: Definitions and Properties
Turing Machines Part I: Definitions and Properties Finite State Automata Deterministic Automata (DFSA) M = {Q, Σ, δ, q 0, F} -- Σ = Symbols -- Q = States -- q 0 = Initial State -- F = Accepting States
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 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 informationACS2: Decidability Decidability
Decidability Bernhard Nebel and Christian Becker-Asano 1 Overview An investigation into the solvable/decidable Decidable languages The halting problem (undecidable) 2 Decidable problems? Acceptance problem
More informationPumping for Ordinal-Automatic Structures *
Computability 1 (2012) 1 40 DOI IOS Press 1 Pumping for Ordinal-Automatic Structures * Martin Huschenbett Institut für Informatik, Ludwig-Maximilians-Universität München, Germany martin.huschenbett@ifi.lmu.de
More informationAcceptance of!-languages by Communicating Deterministic Turing Machines
Acceptance of!-languages by Communicating Deterministic Turing Machines Rudolf Freund Institut für Computersprachen, Technische Universität Wien, Karlsplatz 13 A-1040 Wien, Austria Ludwig Staiger y Institut
More informationFoundations of Informatics: a Bridging Course
Foundations of Informatics: a Bridging Course Week 3: Formal Languages and Semantics Thomas Noll Lehrstuhl für Informatik 2 RWTH Aachen University noll@cs.rwth-aachen.de http://www.b-it-center.de/wob/en/view/class211_id948.html
More informationTopological extension of parity automata
Topological extension of parity automata Micha l Skrzypczak University of Warsaw Institute of Informatics Banacha 2 02-097 Warsaw, Poland Abstract The paper presents a concept of a coloring an extension
More informationCS256/Spring 2008 Lecture #11 Zohar Manna. Beyond Temporal Logics
CS256/Spring 2008 Lecture #11 Zohar Manna Beyond Temporal Logics Temporal logic expresses properties of infinite sequences of states, but there are interesting properties that cannot be expressed, e.g.,
More informationCovering of ordinals
Covering of ordinals Laurent Braud IGM, Univ. Paris-Est Liafa, 8 January 2010 Laurent Braud (IGM, Univ. Paris-Est) Covering of ordinals Liafa, 8 January 2010 1 / 27 1 Covering graphs Ordinals MSO logic
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 informationProbabilistic Aspects of Computer Science: Probabilistic Automata
Probabilistic Aspects of Computer Science: Probabilistic Automata Serge Haddad LSV, ENS Paris-Saclay & CNRS & Inria M Jacques Herbrand Presentation 2 Properties of Stochastic Languages 3 Decidability Results
More informationUncountable Automatic Classes and Learning
Uncountable Automatic Classes and Learning Sanjay Jain a,1, Qinglong Luo a, Pavel Semukhin b,2, Frank Stephan c,3 a Department of Computer Science, National University of Singapore, Singapore 117417, Republic
More information4.2 The Halting Problem
172 4.2 The Halting Problem The technique of diagonalization was discovered in 1873 by Georg Cantor who was concerned with the problem of measuring the sizes of infinite sets For finite sets we can simply
More informationTheory of Computation
Fall 2002 (YEN) Theory of Computation Midterm Exam. Name:... I.D.#:... 1. (30 pts) True or false (mark O for true ; X for false ). (Score=Max{0, Right- 1 2 Wrong}.) (1) X... If L 1 is regular and L 2 L
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 informationX-machines - a computational model framework.
Chapter 2. X-machines - a computational model framework. This chapter has three aims: To examine the main existing computational models and assess their computational power. To present the X-machines as
More informationOn Decidability Properties of One-Dimensional Cellular Automata
On Decidability Properties of One-Dimensional Cellular Automata arxiv:0903.4615v1 [cs.lo] 26 Mar 2009 Olivier Finkel Equipe de Logique Mathématique CNRS et Université Paris 7, France. finkel@logique.jussieu.fr
More informationUnary Automatic Graphs: An Algorithmic Perspective 1
Unary Automatic Graphs: An Algorithmic Perspective 1 This paper studies infinite graphs produced from a natural unfolding operation applied to finite graphs. Graphs produced via such operations are of
More informationFinite Universes. L is a fixed-length language if it has length n for some
Finite Universes Finite Universes When the universe is finite (e.g., the interval 0, 2 1 ), all objects can be encoded by words of the same length. A language L has length n 0 if L =, or every word of
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 informationLearning of Bi-ω Languages from Factors
JMLR: Workshop and Conference Proceedings 21:139 144, 2012 The 11th ICGI Learning of Bi-ω Languages from Factors M. Jayasrirani mjayasrirani@yahoo.co.in Arignar Anna Government Arts College, Walajapet
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 informationCSE 105 THEORY OF COMPUTATION. Spring 2018 review class
CSE 105 THEORY OF COMPUTATION Spring 2018 review class Today's learning goals Summarize key concepts, ideas, themes from CSE 105. Approach your final exam studying with confidence. Identify areas to focus
More informationFORMAL LANGUAGES, AUTOMATA AND COMPUTABILITY
5-453 FORMAL LANGUAGES, AUTOMATA AND COMPUTABILITY NON-DETERMINISM and REGULAR OPERATIONS THURSDAY JAN 6 UNION THEOREM The union of two regular languages is also a regular language Regular Languages Are
More informationLecturecise 22 Weak monadic second-order theory of one successor (WS1S)
Lecturecise 22 Weak monadic second-order theory of one successor (WS1S) 2013 Reachability in the Heap Many programs manipulate linked data structures (lists, trees). To express many important properties
More informationModels of Computation. by Costas Busch, LSU
Models of Computation by Costas Busch, LSU 1 Computation CPU memory 2 temporary memory input memory CPU output memory Program memory 3 Example: f ( x) x 3 temporary memory input memory Program memory compute
More information1.4 Cardinality. Tom Lewis. Fall Term Tom Lewis () 1.4 Cardinality Fall Term / 9
1.4 Cardinality Tom Lewis Fall Term 2006 Tom Lewis () 1.4 Cardinality Fall Term 2006 1 / 9 Outline 1 Functions 2 Cardinality 3 Cantor s theorem Tom Lewis () 1.4 Cardinality Fall Term 2006 2 / 9 Functions
More informationOn the Expressiveness and Complexity of Randomization in Finite State Monitors
On the Expressiveness and Complexity of Randomization in Finite State Monitors Rohit Chadha Univ. of Illinois at Urbana-Champaign and A. Prasad Sistla Univ. of Illinois at Chicago and Mahesh Viswanathan
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 information5 3 Watson-Crick Automata with Several Runs
5 3 Watson-Crick Automata with Several Runs Peter Leupold Department of Mathematics, Faculty of Science Kyoto Sangyo University, Japan Joint work with Benedek Nagy (Debrecen) Presentation at NCMA 2009
More informationComputability and Complexity
Computability and Complexity Lecture 5 Reductions Undecidable problems from language theory Linear bounded automata given by Jiri Srba Lecture 5 Computability and Complexity 1/14 Reduction Informal Definition
More informationTHEORY OF COMPUTATION (AUBER) EXAM CRIB SHEET
THEORY OF COMPUTATION (AUBER) EXAM CRIB SHEET Regular Languages and FA A language is a set of strings over a finite alphabet Σ. All languages are finite or countably infinite. The set of all languages
More informationMATH 3300 Test 1. Name: Student Id:
Name: Student Id: There are nine problems (check that you have 9 pages). Solutions are expected to be short. In the case of proofs, one or two short paragraphs should be the average length. Write your
More informationFinite State Transducers
Finite State Transducers Eric Gribkoff May 29, 2013 Original Slides by Thomas Hanneforth (Universitat Potsdam) Outline 1 Definition of Finite State Transducer 2 Examples of FSTs 3 Definition of Regular
More informationHKN CS/ECE 374 Midterm 1 Review. Nathan Bleier and Mahir Morshed
HKN CS/ECE 374 Midterm 1 Review Nathan Bleier and Mahir Morshed For the most part, all about strings! String induction (to some extent) Regular languages Regular expressions (regexps) Deterministic finite
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 informationPart II. Logic and Set Theory. Year
Part II Year 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2018 60 Paper 4, Section II 16G State and prove the ǫ-recursion Theorem. [You may assume the Principle of ǫ- Induction.]
More informationInformal Statement Calculus
FOUNDATIONS OF MATHEMATICS Branches of Logic 1. Theory of Computations (i.e. Recursion Theory). 2. Proof Theory. 3. Model Theory. 4. Set Theory. Informal Statement Calculus STATEMENTS AND CONNECTIVES Example
More informationOn the Borel complexity of MSO definable sets of branches
Fundamenta Informaticae XXI (2001) 1001 1013 1001 IOS Press On the Borel complexity of MSO definable sets of branches Mikołaj Bojańczyk, Damian Niwiński Institute of Informatics University of Warsaw Poland
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 informationPushdown automata. Twan van Laarhoven. Institute for Computing and Information Sciences Intelligent Systems Radboud University Nijmegen
Pushdown automata Twan van Laarhoven Institute for Computing and Information Sciences Intelligent Systems Version: fall 2014 T. van Laarhoven Version: fall 2014 Formal Languages, Grammars and Automata
More informationIntroduction to Turing Machines
Introduction to Turing Machines Deepak D Souza Department of Computer Science and Automation Indian Institute of Science, Bangalore. 12 November 2015 Outline 1 Turing Machines 2 Formal definitions 3 Computability
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 informationOn Stateless Multicounter Machines
On Stateless Multicounter Machines Ömer Eğecioğlu and Oscar H. Ibarra Department of Computer Science University of California, Santa Barbara, CA 93106, USA Email: {omer, ibarra}@cs.ucsb.edu Abstract. We
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 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 informationCPSC 421: Tutorial #1
CPSC 421: Tutorial #1 October 14, 2016 Set Theory. 1. Let A be an arbitrary set, and let B = {x A : x / x}. That is, B contains all sets in A that do not contain themselves: For all y, ( ) y B if and only
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 informationSection 2: Classes of Sets
Section 2: Classes of Sets Notation: If A, B are subsets of X, then A \ B denotes the set difference, A \ B = {x A : x B}. A B denotes the symmetric difference. A B = (A \ B) (B \ A) = (A B) \ (A B). Remarks
More informationAdvanced Automata Theory 7 Automatic Functions
Advanced Automata Theory 7 Automatic Functions Frank Stephan Department of Computer Science Department of Mathematics National University of Singapore fstephan@comp.nus.edu.sg Advanced Automata Theory
More informationacs-07: Decidability Decidability Andreas Karwath und Malte Helmert Informatik Theorie II (A) WS2009/10
Decidability Andreas Karwath und Malte Helmert 1 Overview An investigation into the solvable/decidable Decidable languages The halting problem (undecidable) 2 Decidable problems? Acceptance problem : decide
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 information} Some languages are Turing-decidable A Turing Machine will halt on all inputs (either accepting or rejecting). No infinite loops.
and their languages } Some languages are Turing-decidable A Turing Machine will halt on all inputs (either accepting or rejecting). No infinite loops. } Some languages are Turing-recognizable, but not
More informationName: Student ID: Instructions:
Instructions: Name: CSE 322 Autumn 2001: Midterm Exam (closed book, closed notes except for 1-page summary) Total: 100 points, 5 questions, 20 points each. Time: 50 minutes 1. Write your name and student
More informationCSE 105 THEORY OF COMPUTATION
CSE 105 THEORY OF COMPUTATION Spring 2017 http://cseweb.ucsd.edu/classes/sp17/cse105-ab/ Today's learning goals Summarize key concepts, ideas, themes from CSE 105. Approach your final exam studying with
More informationECS 120 Lesson 15 Turing Machines, Pt. 1
ECS 120 Lesson 15 Turing Machines, Pt. 1 Oliver Kreylos Wednesday, May 2nd, 2001 Before we can start investigating the really interesting problems in theoretical computer science, we have to introduce
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 informationRecursion and Topology on 2 ω for Possibly Infinite Computations. Verónica Becher Departamento de Computación, Universidad de Buenos Aires, Argentina
Recursion and Topology on 2 ω for Possibly Infinite Computations Verónica Becher Departamento de Computación, Universidad de Buenos Aires, Argentina vbecher@dc.uba.ar Serge Grigorieff LIAFA, Université
More informationTHEORY OF COMPUTATION
THEORY OF COMPUTATION There are four sorts of men: He who knows not and knows not he knows not: he is a fool - shun him; He who knows not and knows he knows not: he is simple teach him; He who knows and
More informationA Universal Turing Machine
A Universal Turing Machine A limitation of Turing Machines: Turing Machines are hardwired they execute only one program Real Computers are re-programmable Solution: Universal Turing Machine Attributes:
More informationFORMAL LANGUAGES, AUTOMATA AND COMPUTATION
FORMAL LANGUAGES, AUTOMATA AND COMPUTATION DECIDABILITY ( LECTURE 15) SLIDES FOR 15-453 SPRING 2011 1 / 34 TURING MACHINES-SYNOPSIS The most general model of computation Computations of a TM are described
More informationSolutions to Tutorial 8 (Week 9)
The University of Sydney School of Mathematics and Statistics Solutions to Tutorial 8 (Week 9) MATH3961: Metric Spaces (Advanced) Semester 1, 2018 Web Page: http://www.maths.usyd.edu.au/u/ug/sm/math3961/
More information10. Finite Automata and Turing Machines
. Finite Automata and Turing Machines Frank Stephan March 2, 24 Introduction Alan Turing s th Birthday Alan Turing was a completely original thinker who shaped the modern world, but many people have never
More informationPushdown Automata. We have seen examples of context-free languages that are not regular, and hence can not be recognized by finite automata.
Pushdown Automata We have seen examples of context-free languages that are not regular, and hence can not be recognized by finite automata. Next we consider a more powerful computation model, called a
More informationHomework Assignment 6 Answers
Homework Assignment 6 Answers CSCI 2670 Introduction to Theory of Computing, Fall 2016 December 2, 2016 This homework assignment is about Turing machines, decidable languages, Turing recognizable languages,
More informationTopologies refining the CANTOR topology on X ω
CDMTCS Research Report Series Topologies refining the CANTOR topology on X ω Sibylle Schwarz Westsächsische Hochschule Zwickau Ludwig Staiger Martin-Luther-Universität Halle-Wittenberg CDMTCS-385 June
More informationSYLLABUS. Introduction to Finite Automata, Central Concepts of Automata Theory. CHAPTER - 3 : REGULAR EXPRESSIONS AND LANGUAGES
Contents i SYLLABUS UNIT - I CHAPTER - 1 : AUT UTOMA OMATA Introduction to Finite Automata, Central Concepts of Automata Theory. CHAPTER - 2 : FINITE AUT UTOMA OMATA An Informal Picture of Finite Automata,
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 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 informationFinal exam study sheet for CS3719 Turing machines and decidability.
Final exam study sheet for CS3719 Turing machines and decidability. A Turing machine is a finite automaton with an infinite memory (tape). Formally, a Turing machine is a 6-tuple M = (Q, Σ, Γ, δ, q 0,
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 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 informationNAME: Mathematics 205A, Fall 2008, Final Examination. Answer Key
NAME: Mathematics 205A, Fall 2008, Final Examination Answer Key 1 1. [25 points] Let X be a set with 2 or more elements. Show that there are topologies U and V on X such that the identity map J : (X, U)
More information