Nominal Automata. Mikolaj Bojanczyk 1, Bartek Klin 12, Slawomir Lasota 1 1. University of Cambridge. Warsaw University 2. Leicester, 04/03/11
|
|
|
- Florence Mills
- 6 years ago
- Views:
Transcription
1 Nominal Automata Mikolaj Bojanczyk 1, Bartek Klin 12, Slawomir Lasota 1 1 Warsaw University 2 University of Cambridge Leicester, 04/03/11
2 Finite automata An automaton: - set Q of states - alphabet A - transition function δ : Q A Q - initial state q 0 Q - accepting states Q a Q Leicester, 04/03/11 2 / 17
3 Finite automata An automaton: - set Q of states - alphabet A - transition function δ : Q A Q - initial state q 0 Q - accepting states Q a Q 1 Q A Q δ α 2 ι Leicester, 04/03/11 2 / 17
4 Finite automata An automaton: - set Q of states - alphabet A finite - transition function δ : Q A Q - initial state q 0 Q - accepting states Q a Q 1 Q A Q δ α 2 ι Leicester, 04/03/11 2 / 17
5 Finite automata An automaton: - set Q of states - alphabet A? finite - transition function δ : Q A Q - initial state q 0 Q - accepting states Q a Q 1 Q A Q δ α 2 ι Leicester, 04/03/11 2 / 17
6 Finite memory automata [FK] A = N Idea: store numbers in configurations... Leicester, 04/03/11 3 / 17
7 Finite memory automata [FK] A = N Idea: store numbers in configurations but only compare them for equality Leicester, 04/03/11 3 / 17
8 Finite memory automata [FK] A = N - finite set Q of states Leicester, 04/03/11 3 / 17
9 Finite memory automata [FK] A = N - finite set Q of states - finite store R of registers Leicester, 04/03/11 3 / 17
10 Finite memory automata [FK] A = N - finite set Q of states - finite store R of registers configurations: X = Q (A + 1) R Leicester, 04/03/11 3 / 17
11 Finite memory automata [FK] A = N - finite set Q of states - finite store R of registers configurations: X = Q (A + 1) R - transition function δ : X A X - only checks letters for equality - new store old store { letter just read} Leicester, 04/03/11 3 / 17
12 Finite memory automata [FK] A = N - finite set Q of states - finite store R of registers configurations: X = Q (A + 1) R - transition function δ : X A X - only checks letters for equality - new store old store { letter just read} - initial state, accepting states Leicester, 04/03/11 3 / 17
13 Example The first letter appears again L = {a 1 a 2... a n N k >1. a 1 = a k } Leicester, 04/03/11 4 / 17
14 Example The first letter appears again L = {a 1 a 2... a n N k >1. a 1 = a k } b a a a ( ) (a) ( ) Leicester, 04/03/11 4 / 17
15 Example The first letter appears again L = {a 1 a 2... a n N k >1. a 1 = a k } b a initial a a ( ) (a) ( ) accepting Leicester, 04/03/11 4 / 17
16 Example The first letter appears again L = {a 1 a 2... a n N k >1. a 1 = a k } b a initial a a ( ) (a) ( ) accepting The last letter appears before L = {a 1 a 2... a n N k < n. a k = a n } Leicester, 04/03/11 4 / 17
17 Example The first letter appears again L = {a 1 a 2... a n N k >1. a 1 = a k } b a initial a a ( ) (a) ( ) accepting The last letter appears before L = {a 1 a 2... a n N k < n. a k = a n } not recognizable Leicester, 04/03/11 4 / 17
18 Finite memory automata [FK] - finite set Q of states - finite store R of registers configurations: X = Q (A + 1) R - transition function δ : X A X - only checks letters for equality - new store old store { letter just read} - initial state, accepting states Leicester, 04/03/11 5 / 17
19 Finite memory automata [FK] - finite set Q of states - finite store R of registers configurations: X = Q (A + 1) R - transition function δ : X A X - only checks letters for equality - new store old store { letter just read} - initial state, accepting states 1 X A X δ α 2 ι Leicester, 04/03/11 5 / 17
20 Syntactic automata Myhill-Nerode equivalence: L A v L w u A. (vu L wu L) Leicester, 04/03/11 6 / 17
21 Syntactic automata Myhill-Nerode equivalence: L A v L w u A. (vu L wu L) Fact: v L w = vu L wu Leicester, 04/03/11 6 / 17
22 Syntactic automata Myhill-Nerode equivalence: L A v L w u A. (vu L wu L) Fact: v L w = vu L wu 1 A / L A ι A / L α 2 Initial: [ɛ] L Accepting: {[w] L w L} Leicester, 04/03/11 6 / 17
23 Syntactic automata Myhill-Nerode equivalence: L A v L w u A. (vu L wu L) Fact: v L w = vu L wu 1 Syntactic ι automaton A / L A A / L α 2 Initial: [ɛ] L Accepting: {[w] L w L} Leicester, 04/03/11 6 / 17
24 Minimization problems for F.M.A. L = {abc a b, c {a, b}} A 3 Leicester, 04/03/11 7 / 17
25 Minimization problems for F.M.A. L = {abc a b, c {a, b}} A 3 (, ) a (a, ) a b a (, ) c {a,b} c {a,b} (, ) (a, b) Leicester, 04/03/11 7 / 17
26 Minimization problems for F.M.A. L = {abc a b, c {a, b}} A 3 (, ) a (a, ) a b a (, ) c {a,b} c {a,b} (, ) (, ) (, ) ab (a, b) ba (b, a) (a, b) Leicester, 04/03/11 7 / 17
27 Minimization problems for F.M.A. L = {abc a b, c {a, b}} A 3 (, ) a (a, ) a b a (, ) c {a,b} c {a,b} (, ) (, ) (, ) ab (a, b) ba (b, a) but ab L ba (a, b) Leicester, 04/03/11 7 / 17
28 Minimization problems for F.M.A. L = {abc a b, c {a, b}} A 3 (, ) a (a, ) a b a (, ) c {a,b} c {a,b} (, ) (, ) (, ) ab (a, b) ba (b, a) but ab L ba (a, b) Worse: for any G Sym({1, 2,..., n}), L = {a 1 a n b 1 b n π G. i =1..n. a i = b π(i) } Leicester, 04/03/11 7 / 17
29 F.M.A. are equivariant Fix G = Sym(A). Defn.: A G -set is: - a set X - an action : X G X (+ axioms) Defn.: Function f : X Y is equivariant if f(x π) =f(x) π Leicester, 04/03/11 8 / 17
30 F.M.A. are equivariant Fix G = Sym(A). Defn.: A G -set is: - a set X - an action : X G X (+ axioms) Defn.: Function f : X Y is equivariant if f(x π) =f(x) π category G-Set Leicester, 04/03/11 8 / 17
31 F.M.A. are equivariant Fix G = Sym(A). Defn.: A G -set is: - a set X - an action : X G X (+ axioms) Defn.: Function f : X Y is equivariant if f(x π) =f(x) π category G-Set Fact: In a F.M.A.: - configurations form a G-set - is equivariant δ : X A X Leicester, 04/03/11 8 / 17
32 G-set automata Idea: study diagrams 1 X A X δ α 2 ι in G-Set. Leicester, 04/03/11 9 / 17
33 G-set automata Idea: study diagrams 1 finite? X A X δ α 2 ι in G-Set. Leicester, 04/03/11 9 / 17
34 G-set automata Idea: study diagrams 1 finite? X A X δ α 2 ι in G-Set. Defn.: The orbit of x X : x G = {x π π G} Leicester, 04/03/11 9 / 17
35 G-set automata Idea: study diagrams 1 finite? X A X δ α 2 ι in G-Set. Defn.: The orbit of x X : x G = {x π π G} In an F.M.A., Q = orbits(x) Leicester, 04/03/11 9 / 17
36 G-set automata Idea: study diagrams 1 finite? X A X δ α 2 ι in G-Set. Defn.: The orbit of x X : x G = {x π π G} In an F.M.A., Q = orbits(x) So we require X orbit-finite. Leicester, 04/03/11 9 / 17
37 G-set automata Idea: study diagrams 1 finite? X A X δ α 2 ι in G-Set. Defn.: The orbit of x X : x G = {x π π G} In an F.M.A., Q = orbits(x) So we require X orbit-finite. Can we model finiteness of the store? Leicester, 04/03/11 9 / 17
38 Nominal sets [GP] Defn.: C A supports x X if c C. π(c) =c = x π = x Leicester, 04/03/11 10 / 17
39 Nominal sets [GP] Defn.: C A supports x X if c C. π(c) =c = x π = x Nominal set: every element has a finite support. Leicester, 04/03/11 10 / 17
40 Nominal sets [GP] Defn.: C A supports x X if c C. π(c) =c = x π = x Nominal set: every element has a finite support. G-Nom: nominal sets and equivariant functions Leicester, 04/03/11 10 / 17
41 Nominal sets [GP] Defn.: C A supports x X if c C. π(c) =c = x π = x Nominal set: every element has a finite support. G-Nom: nominal sets and equivariant functions Fact: In a nominal set, every x has the least support Leicester, 04/03/11 10 / 17
42 Nominal sets [GP] Defn.: C A supports x X if c C. π(c) =c = x π = x Nominal set: every element has a finite support. G-Nom: nominal sets and equivariant functions Fact: In a nominal set, every x has the least support supp(x) = { a A {b A x (ab) x} is infinite } Leicester, 04/03/11 10 / 17
43 Nominal automata 1 X A δ X α 2 ι G-Nom Leicester, 04/03/11 11 / 17
44 Nominal automata 1 X A δ X α 2 ι G-Nom - finite set Q of states Leicester, 04/03/11 11 / 17
45 Nominal automata 1 X A δ X α 2 ι G-Nom - finite set Q of states - for each state: finite set R q, group S q Sym(R q ) Leicester, 04/03/11 11 / 17
46 Nominal automata 1 X A δ X α 2 ι G-Nom - finite set Q of states - for each state: finite set R q, group S q Sym(R q ) - transition: θ : q Q (R q + 1) p Q ((R q + 1) R p ) Leicester, 04/03/11 11 / 17
47 Nominal automata 1 X A δ X α 2 ι G-Nom - finite set Q of states - for each state: finite set R q, group S q Sym(R q ) - transition: θ : q Q (R q + 1) p Q ((R q + 1) R p ) + a condition involving S q,s p Leicester, 04/03/11 11 / 17
48 Nominal automata 1 X A δ X α 2 ι G-Nom - finite set Q of states - for each state: finite set R q, group S q Sym(R q ) - transition: θ : q Q (R q + 1) p Q ((R q + 1) R p ) - initial, accepting states + a condition involving S q,s p Leicester, 04/03/11 11 / 17
49 Nominal automata 1 X A δ X α 2 ι G-Nom X = q Q (AR q up to S q ) - finite set Q of states - for each state: finite set R q, group S q Sym(R q ) - transition: θ : q Q (R q + 1) p Q ((R q + 1) R p ) - initial, accepting states + a condition involving S q,s p Leicester, 04/03/11 11 / 17
50 Nominal automata 1 X A δ X α 2 ι G-Nom Q = orbits(x) - finite set Q of states R q = supp(x) S q = G x (x q) - for each state: finite set R q, group S q Sym(R q ) - transition: θ : q Q (R q + 1) p Q ((R q + 1) R p ) - initial, accepting states + a condition involving S q,s p Leicester, 04/03/11 11 / 17
51 Structured alphabets Leicester, 04/03/11 12 / 17
52 Structured alphabets Q: What if the alphabet is equipped with - a total order, - a partial order, - a graph structure, -... which we can check for? Leicester, 04/03/11 12 / 17
53 Structured alphabets Q: What if the alphabet is equipped with - a total order, - a partial order, - a graph structure, -... which we can check for? A: Repeat the theory with some G Sym(A) E.g. G = monotone bijections of Q Leicester, 04/03/11 12 / 17
54 G -nominal sets Defn.: C A supports x X π G ( c C. π(c) =c = x π = x ) if Nominal set: every element has a finite support. G-Nom: G-nominal sets and equivariant functions Leicester, 04/03/11 13 / 17
55 G -nominal sets Defn.: C A supports x X π G ( c C. π(c) =c = x π = x ) if Nominal set: every element has a finite support. G-Nom: G-nominal sets and equivariant functions Caution: least supports might not exist. Leicester, 04/03/11 13 / 17
56 Representing G -nominal sets Automaton: - orbit-finite G-set X -... Leicester, 04/03/11 14 / 17
57 Representing G -nominal sets Step 1: every G-set is a sum of single-orbit ones. Automaton: - orbit-finite G-set X -... Leicester, 04/03/11 14 / 17
58 Representing G -nominal sets Step 1: every G-set is a sum of single-orbit ones. Automaton: - finite set Q of states - for each state: single-orbit nominal set X q -... Leicester, 04/03/11 14 / 17
59 Representing G -nominal sets Step 1: every G-set is a sum of single-orbit ones. Step 2: for any single-orbit X, X = G/H r for some H G. Automaton: - finite set Q of states - for each state: single-orbit nominal set X q -... Leicester, 04/03/11 14 / 17
60 Representing G -nominal sets Step 1: every G-set is a sum of single-orbit ones. Step 2: for any single-orbit X, X = G/H r for some H G. Automaton: - finite set Q of states - for each state: group H q G -... Leicester, 04/03/11 14 / 17
61 Representing G -nominal sets Step 1: every G-set is a sum of single-orbit ones. Step 2: for any single-orbit X, X = G/H r for some H G. Step 3: X nominal iff H open: G C = {π G π C = id} H for some C fin A Automaton: - finite set Q of states - for each state: group H q G -... Leicester, 04/03/11 14 / 17
62 Representing G -nominal sets Step 1: every G-set is a sum of single-orbit ones. Step 2: for any single-orbit X, X = G/H r for some H G. Step 3: X nominal iff H open: G C = {π G π C = id} H for some C fin A Automaton: - finite set Q of states - for each state: open group H q G -... Leicester, 04/03/11 14 / 17
63 Representing G -nominal sets Step 1: every G-set is a sum of single-orbit ones. Step 2: for any single-orbit X, X = G/H r for some H G. Step 3: X nominal iff H open: G C = {π G π C = id} H for some C fin A Step 4:... Automaton: - finite set Q of states - for each state: -... open group H q G Leicester, 04/03/11 14 / 17
64 Fraïssé limits Idea: - N universally embeds finite sets - Q universally embeds finite total orders - universal partial order? graph? etc. Leicester, 04/03/11 15 / 17
65 Fraïssé limits Idea: - N universally embeds finite sets - Q universally embeds finite total orders - universal partial order? graph? etc. Fraïssé construction: a class of finite rel. structures closed under - isomorphisms - substructures - amalgamation has a countable limit U that embeds them. Leicester, 04/03/11 15 / 17
66 Fraïssé limits Idea: - N universally embeds finite sets - Q universally embeds finite total orders - universal partial order? graph? etc. Fraïssé construction: a class of finite rel. structures closed under - isomorphisms - substructures - amalgamation has a countable limit U that embeds them. We use G = Aut(U) Sym( U ) Leicester, 04/03/11 15 / 17
67 Fraïssé automata Fix a class K of relational structures (subject to conditions) Leicester, 04/03/11 16 / 17
68 Fraïssé automata Fix a class K of relational structures (subject to conditions) Automaton: - finite set Q of states fin. structure, - for each state: R q group S q Aut(R q ) Leicester, 04/03/11 16 / 17
69 Fraïssé automata Fix a class K of relational structures (subject to conditions) Automaton: - finite set Q of states fin. structure, - for each state: R q group S q Aut(R q ) configurations: embeddings of R q in U up to S q Leicester, 04/03/11 16 / 17
70 Fraïssé automata Fix a class K of relational structures (subject to conditions) Automaton: - finite set Q of states fin. structure, - for each state: R q group S q Aut(R q ) configurations: embeddings of R q in U up to S q - transition function:... - initial, accepting states Leicester, 04/03/11 16 / 17
71 More fun Leicester, 04/03/11 17 / 17
72 More fun In Fraïssé situations, we represent in a finite way: - G-nominal sets - subsets, products - equivariant functions and relations - 1 st -order logic is decidable on orbit-finite sets Leicester, 04/03/11 17 / 17
73 More fun In Fraïssé situations, we represent in a finite way: - G-nominal sets - subsets, products - equivariant functions and relations - 1 st -order logic is decidable on orbit-finite sets So we can represent: - automata - push-down automata - Turing machines -... Leicester, 04/03/11 17 / 17
74 More fun In Fraïssé situations, we represent in a finite way: - G-nominal sets - subsets, products - equivariant functions and relations - 1 st -order logic is decidable on orbit-finite sets So we can represent: - automata - push-down automata - Turing machines Is P = NP in nominal sets? -... Leicester, 04/03/11 17 / 17
Automata with group actions
Automata with group actions Mikołaj Bojańczyk University of Warsaw Bartek Klin University of Cambridge, University of Warsaw Sławomir Lasota University of Warsaw Abstract Our motivating question is a Myhill-Nerode
Automata extended to nominal sets
Bachelor thesis Computer Science Radboud University Automata extended to nominal sets Author: Joep Veldhoven s4456556 First supervisor/assessor: Jurriaan Rot jrot@cs.ru.nl Second and third supervisor:
Names and Symmetry in Computer Science
1/27 Names and Symmetry in Computer Science Andrew Pitts Computer Laboratory LICS 2015 Tutorial 2/27 An introduction to nominal techniques motivated by Programming language semantics Automata theory Constructive
What 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
16.1 Countability. CS125 Lecture 16 Fall 2014
CS125 Lecture 16 Fall 2014 16.1 Countability Proving the non-existence of algorithms for computational problems can be very difficult. Indeed, we do not know how to prove P NP. So a natural question is
Algebras 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)
Topology in Denotational Semantics
Journées Topologie et Informatique Thomas Ehrhard Preuves, Programmes et Systèmes (PPS) Université Paris Diderot - Paris 7 and CNRS March 21, 2013 What is denotational semantics? The usual stateful approach
Decision Problems for Additive Regular Functions
Decision Problems for Additive Regular Functions Rajeev Alur and Mukund Raghothaman University of Pennsylvania {alur, rmukund}@cis.upenn.edu Abstract. Additive Cost Register Automata (ACRA) map strings
CS 154 Introduction to Automata and Complexity Theory
CS 154 Introduction to Automata and Complexity Theory cs154.stanford.edu 1 INSTRUCTORS & TAs Ryan Williams Cody Murray Lera Nikolaenko Sunny Rajan 2 Textbook 3 Homework / Problem Sets Homework will be
Equivalence of TMs and Multitape TMs. Theorem 3.13 and Corollary 3.15 By: Joseph Lauman
Equivalence of TMs and Multitape TMs Theorem 3.13 and Corollary 3.15 By: Joseph Lauman Turing Machines First proposed by Alan Turing in 1936 Similar to finite automaton, but with an unlimited and unrestricted
Part 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
Introduction to Automata
Introduction to Automata Seungjin Choi Department of Computer Science and Engineering Pohang University of Science and Technology 77 Cheongam-ro, Nam-gu, Pohang 37673, Korea seungjin@postech.ac.kr 1 /
DM17. 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....................
Completeness and Incompleteness in nominal Kleene algebra
1/35 Completeness and Incompleteness in nominal Kleene algebra Dexter Kozen, Konstantinos Mamouras, Alexandra Silva Cornell University, University College London & HasLab INESC TEC September 28th, 2015
MFPS LICS Special Session Honouring Dana Scott. Symmetric Scott. Andrew Pitts. Computer Laboratory MFPS/LICS /14
MFPS/LICS 2013 1/14 MFPS LICS Special Session Honouring Dana Scott Symmetric Scott Andrew Pitts Computer Laboratory 80 years of Dana Scott MFPS/LICS 2013 2/14 automata theory set theory sheaves & logic
Introduction to Kleene Algebras
Introduction to Kleene Algebras Riccardo Pucella Basic Notions Seminar December 1, 2005 Introduction to Kleene Algebras p.1 Idempotent Semirings An idempotent semiring is a structure S = (S, +,, 1, 0)
Bü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
6.8 The Post Correspondence Problem
6.8. THE POST CORRESPONDENCE PROBLEM 423 6.8 The Post Correspondence Problem The Post correspondence problem (due to Emil Post) is another undecidable problem that turns out to be a very helpful tool for
G i. h i f i G h f j. G j
2. TWO BASIC CONSTRUCTIONS Free Products with amalgamation. Let {G i i I} be a family of gps, A a gp and α i : A G i a monomorphism, i I. A gp G is the free product of the G i with A amalgamated (via the
Monoidal 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
Notes on State Minimization
U.C. Berkeley CS172: Automata, Computability and Complexity Handout 1 Professor Luca Trevisan 2/3/2015 Notes on State Minimization These notes present a technique to prove a lower bound on the number of
Obtaining 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
Theory 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
Computability Theory for Neuroscience
Computability Theory for Neuroscience by Doug Rubino Abstract Neuronal circuits are ubiquitously held to be the substrate of computation in the brain, information processing in single neurons is though
The 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
Advanced Automata Theory 9 Automatic Structures in General
Advanced Automata Theory 9 Automatic Structures in General Frank Stephan Department of Computer Science Department of Mathematics National University of Singapore fstephan@comp.nus.edu.sg Advanced Automata
2. Elements of the Theory of Computation, Lewis and Papadimitrou,
Introduction Finite Automata DFA, regular languages Nondeterminism, NFA, subset construction Regular Epressions Synta, Semantics Relationship to regular languages Properties of regular languages Pumping
Algebraic 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
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
On 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
Theory of Computation Lecture 1. Dr. Nahla Belal
Theory of Computation Lecture 1 Dr. Nahla Belal Book The primary textbook is: Introduction to the Theory of Computation by Michael Sipser. Grading 10%: Weekly Homework. 30%: Two quizzes and one exam. 20%:
Duality 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
On the use of guards for logics with data
Author manuscript, published in "Proceedings of MFCS 2011, Warsaw : Poland (2011)" DOI : 10.1007/978-3-642-22993-0_24 On the use of guards for logics with data Thomas Colcombet 1, Clemens Ley 2, Gabriele
3515ICT: Theory of Computation. Regular languages
3515ICT: Theory of Computation Regular languages Notation and concepts concerning alphabets, strings and languages, and identification of languages with problems (H, 1.5). Regular expressions (H, 3.1,
Chapter 1. Automata over infinite alphabets
Chapter 1 Automata over infinite alphabets Amaldev Manuel and R. Ramanujam Institute of Mathematical Sciences, C.I.T campus, Taramani, Chennai - 600113. In many contexts such as validation of XML data,
Variable Automata over Infinite Alphabets
Variable Automata over Infinite Alphabets Orna Grumberg a, Orna Kupferman b, Sarai Sheinvald b a Department of Computer Science, The Technion, Haifa 32000, Israel b School of Computer Science and Engineering,
Languages, 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
Quasitriangular structures on (dual) monoid rings
Quasitriangular structures on (dual) monoid rings Nigel Byott University of Exeter, UK Omaha - 23 May 2014 Background/Literature R.G. Underwood, Topics in Modern Algebra - A View Towards Hopf Algebras
Computability 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
Homework 2 /Solutions
MTH 912 Group Theory 1 F18 Homework 2 /Solutions #1. Let G be a Frobenius group with complement H and kernel K. Then K is a subgroup of G if and only if each coset of H in G contains at most one element
Homogeneous structures
Homogeneous structures Robert Gray Centro de Álgebra da Universidade de Lisboa Lisboa, April 2010 Group theory A group is... a set G with a binary operation G G G, (x, y) xy, written multiplicatively,
Computation 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
CSE 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
Tree 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
The 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 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.](/thumbs/89/99844223.jpg "The 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
Non-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
A Succinct Canonical Register Automaton Model
A Succinct Canonical Register Automaton Model Sofia Cassel a, Falk Howar b, Bengt Jonsson a, Maik Merten b, Bernhard Steffen b a Dept. of Information Technology, Uppsala University, Sweden b Chair of Programming
HKN 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
Lecture three: Automata and the algebra-coalgebra duality
Lecture three: Automata and the algebra-coalgebra duality Jan Rutten CWI Amsterdam & Radboud University Nijmegen IPM, Tehran - 13 January 2016 This lecture will explain two diagrams: 1 x c ε σ A r x X
COMP/MATH 300 Topics for Spring 2017 June 5, Review and Regular Languages
COMP/MATH 300 Topics for Spring 2017 June 5, 2017 Review and Regular Languages Exam I I. Introductory and review information from Chapter 0 II. Problems and Languages A. Computable problems can be expressed
INSTITUTE OF MATHEMATICS THE CZECH ACADEMY OF SCIENCES. Katětov functors. Wiesław Kubiś Dragan Mašulović
INSTITUTE OF MATHEMATICS THE CZECH ACADEMY OF SCIENCES Katětov functors Wiesław Kubiś Dragan Mašulović Preprint No. 2-2016 PRAHA 2016 Katětov functors Wies law Kubiś Dragan Mašulović Jan Kochanowski University
INF210 Datamaskinteori (Models of Computation)
INF210 Datamaskinteori (Models of Computation) Textbook: John Martin, Introduction to Languages and the Theory of Computation, McGraw Hill, Third Edition. Fedor V. Fomin Datamaskinteori 1 Datamaskinteori
Computational 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
Equational Theory of Kleene Algebra
Introduction to Kleene Algebra Lecture 7 CS786 Spring 2004 February 16, 2004 Equational Theory of Kleene Algebra We now turn to the equational theory of Kleene algebra. This and the next lecture will be
Automata Theory (2A) Young Won Lim 5/31/18
Automata Theory (2A) Copyright (c) 2018 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 later
THEORY 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
5 Context-Free Languages
CA320: COMPUTABILITY AND COMPLEXITY 1 5 Context-Free Languages 5.1 Context-Free Grammars Context-Free Grammars Context-free languages are specified with a context-free grammar (CFG). Formally, a CFG G
Büchi Automata and Linear Temporal Logic
Büchi Automata and Linear Temporal Logic Joshua D. Guttman Worcester Polytechnic Institute 18 February 2010 Guttman ( WPI ) Büchi & LTL 18 Feb 10 1 / 10 Büchi Automata Definition A Büchi automaton is a
Undecidability. Andreas Klappenecker. [based on slides by Prof. Welch]
![Undecidability. Andreas Klappenecker. [based on slides by Prof. Welch]](/thumbs/81/83378912.jpg "Undecidability. Andreas Klappenecker. [based on slides by Prof. Welch]")
Undecidability Andreas Klappenecker [based on slides by Prof. Welch] 1 Sources Theory of Computing, A Gentle Introduction, by E. Kinber and C. Smith, Prentice-Hall, 2001 Automata Theory, Languages and
Infinite and Finite Model Theory Part II
Infinite and Finite Model Theory Part II Anuj Dawar Computer Laboratory University of Cambridge Lent 2002 3/2002 0 Finite Model Theory Finite Model Theory motivated by computational issues; relationship
Universal words and sequences
Universal words and sequences J. Jonušas January 18, 2017 School of Mathematics and Statistics, University of St Andrews 1 Universal words Let S be a semigroup, let A an alphabet, and let w A +. Then w
ACS2: 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
Duality 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
Aperiodic 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
Counter Automata and Classical Logics for Data Words
Counter Automata and Classical Logics for Data Words Amal Dev Manuel amal@imsc.res.in Institute of Mathematical Sciences, Taramani, Chennai, India. January 31, 2012 Data Words Definition (Data Words) A
(9-5) Def Turing machine, Turing computable functions. (9-7) Def Primitive recursive functions, Primitive recursive implies Turing computable.
(9-5) Def Turing machine, Turing computable functions. A.Miller M773 Computability Theory Fall 2001 (9-7) Def Primitive recursive functions, Primitive recursive implies Turing computable. 1. Prove f(n)
Recognisable Languages over Monads
Recognisable Languages over Monads Miko laj Bojańczyk December 12, 2014 Contents I Introduction 3 1 Examples of monads for words 4 1.1 Possibly infinite words........................ 5 2 Monads and their
CSCI 2200 Foundations of Computer Science Spring 2018 Quiz 3 (May 2, 2018) SOLUTIONS
CSCI 2200 Foundations of Computer Science Spring 2018 Quiz 3 (May 2, 2018) SOLUTIONS 1. [6 POINTS] For language L 1 = {0 n 1 m n, m 1, m n}, which string is in L 1? ANSWER: 0001111 is in L 1 (with n =
Finite-State Machines (Automata) lecture 12
Finite-State Machines (Automata) lecture 12 cl a simple form of computation used widely one way to find patterns 1 A current D B A B C D B C D A C next 2 Application Fields Industry real-time control,
Overlapping tile automata:
Overlapping tile automata: towards a language theory of overlapping structures David Janin LaBRI, Université de Bordeaux Computer Science in Russia, Ekaterinburg, june 2013 1. From strings to overlapping
On the use of guards for logics with data
On the use of guards for logics with data Thomas Colcombet 1, Clemens Ley 2, Gabriele Puppis 2 1 CNRS/LIAFA 2 Department of Computer Science, Oxford University Abstract. The notion of orbit finite data
Nominal Syntax and Semantics
Nominal Syntax and Semantics Andrew Pitts University of Cambridge Computer Laboratory APPSEM 2005, 1 - p. 1 How best to reconcile Mathematics of syntax syntactical issues to do with name-binding and α-conversion
Nominal sets and automata: Representation theory and computations
Nominal sets and automata: Representation theory and computations David Venhoek Supervisors: dr. J.C. Rot MSc. J.S. Moerman Second reader: dhr. dr. W. Bosma Institute for Computing and Information Sciences
FINITE 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
CSE 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
Sanjit A. Seshia EECS, UC Berkeley
EECS 219C: Computer-Aided Verification Explicit-State Model Checking: Additional Material Sanjit A. Seshia EECS, UC Berkeley Acknowledgments: G. Holzmann Checking if M satisfies : Steps 1. Compute Buchi
Lecture 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
Warshall 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
Posets, homomorphisms, and homogeneity
Posets, homomorphisms, and homogeneity Peter J. Cameron p.j.cameron@qmul.ac.uk Dedicated to Jarik Nešetřil on his sixtieth birthday HAPPY BIRTHDAY JARIK! Summary Jarik Nešetřil has made deep contributions
Automata and minimization 1
Automata and minimization 1 Thomas Colcombet, IRIF, CNRS Daniela Petrişan, IRIF, CNRS Already in the seventies, strong results illustrating the intimate relationship between category theory and automata
Introduction to Model Theory
Introduction to Model Theory Charles Steinhorn, Vassar College Katrin Tent, University of Münster CIRM, January 8, 2018 The three lectures Introduction to basic model theory Focus on Definability More
Where does it come from?
1 Course organization Textbook J.E. Hopcroft, R. Motwani, J.D. Ullman Introduction to Automata Theory, Languages, and Computation Second Edition, Addison-Wesley, New York, 2001 We shall cover Chapters
About the relationship between formal logic and complexity classes
About the relationship between formal logic and complexity classes Working paper Comments welcome; my email: armandobcm@yahoo.com Armando B. Matos October 20, 2013 1 Introduction We analyze a particular
Finite and Algorithmic Model Theory II: Automata-Based Methods
Finite and Algorithmic Model Theory II: Automata-Based Methods Anuj Dawar University of Cambridge Computer Laboratory Simons Institute, 30 August 2016 Review We aim to develop tools for studying the expressive
1 Functions, relations, and infinite cardinality
Discrete Structures Prelim 2 sample questions CS2800 Questions selected for fall 2017 1 Functions, relations, and infinite cardinality 1. True/false. For each of the following statements, indicate whether
Theory of Computation
Thomas Zeugmann Hokkaido University Laboratory for Algorithmics http://www-alg.ist.hokudai.ac.jp/ thomas/toc/ Lecture 3: Finite State Automata Motivation In the previous lecture we learned how to formalize
On 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
Griffith University 3130CIT Theory of Computation (Based on slides by Harald Søndergaard of The University of Melbourne) Turing Machines 9-0
Griffith University 3130CIT Theory of Computation (Based on slides by Harald Søndergaard of The University of Melbourne) Turing Machines 9-0 Turing Machines Now for a machine model of much greater power.
The enumeration degrees: Local and global structural interactions
The enumeration degrees: Local and global structural interactions Mariya I. Soskova 1 Sofia University 10th Panhellenic Logic Symposium 1 Supported by a Marie Curie International Outgoing Fellowship STRIDE
Homogeneous structures with non-universal automorphism groups
Homogeneous structures with non-universal automorphism groups arxiv:1811.09650v1 [math.gr] 23 Nov 2018 Wies law Kubiś Mathematical Institute, Czech Academy of Sciences, Czech Republic Cardinal Stefan Wyszyński
C6.2 Push-Down Automata
Theory of Computer Science April 5, 2017 C6. Context-free Languages: Push-down Automata Theory of Computer Science C6. Context-free Languages: Push-down Automata Malte Helmert University of Basel April
Definition 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
Decidability: Church-Turing Thesis
Decidability: Church-Turing Thesis While there are a countably infinite number of languages that are described by TMs over some alphabet Σ, there are an uncountably infinite number that are not Are there
Completely regular Bishop spaces
Completely regular Bishop spaces Iosif Petrakis University of Munich petrakis@math.lmu.de Abstract. Bishop s notion of a function space, here called a Bishop space, is a constructive function-theoretic
Universal sequences for groups and semigroups
Universal sequences for groups and semigroups J. D. Mitchell (joint work with J. Hyde, J. Jonušas, and Y. Péresse) School of Mathematics and Statistics, University of St Andrews 12th September 2017 J.
CHURCH 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 -
2. Syntactic Congruences and Monoids
IAS/PCMI Summer Session 2000 Clay Mathematics Undergraduate Program Advanced Course on Computational Complexity Lecture 3: Algebra and Languages David Mix Barrington and Alexis Maciel July 19, 2000 1.
On the Accepting Power of 2-Tape Büchi Automata
On the Accepting Power of 2-Tape Büchi Automata Equipe de Logique Mathématique Université Paris 7 STACS 2006 Acceptance of infinite words In the sixties, Acceptance of infinite words by finite automata
Injection structures specified by finite state transducers
Injection structures specified by finite state transducers Sam Buss 1, Douglas Cenzer 2, Mia Minnes 3 and Jeffrey B. Remmel 1 1 Department of Mathematics, University of California-San Diego, La Jolla,
Theory 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.