(Co-)algebraic Automata Theory
|
|
- Philip Byrd
- 5 years ago
- Views:
Transcription
1 (Co-)algebraic Automata Theory Sergey Goncharov, Stefan Milius, Alexandra Silva Erlangen, Chair 8 (Theoretical Computer Science)
2 Short Histrory of Coalgebraic Invasion to Automata Theory Deterministic automata as coalgebras [Rutten, 1998]. Generalized regular expressions and Kleene s theorem for (Kripke-)polinomial functors [Silva, 2010]. Generalized powerset construction [Silva et al., 2010]. Regular expressions for equationally presented functors and monads [Myers, 2013]. Context-free languages coalgebraically [Winter et al., 2013]. Erlangen, Sergey Goncharov, Stefan Milius, Alexandra Silva Chair 8 (Theoretical Computer Science) 2
3 Base Case: Moore Automata Moore automaton with input alphabet A and output alphabet B is given by t m : X A X (transition) and o m : X B (output) Put differently, a Moore automaton is a coalgebra m : X B X A on Set. A final L A,B -coalgebra is carried by the set B A of formal power series on B. Its coalgebra structure ι : B A B (B A ) A is given by o ι (σ : A B) = σ(ɛ) and t ι (σ : A B, a) = λw.σ(a w). Equivalently, the L A,B -coalgebra structure can be given in terms if derivatives: given w A, ɛ (σ) = o ι (σ) and a w (σ) = t ι ( w (σ), a) Particular important case is B = 2. Then B A P(A ) is the set of all formal languages over A. Erlangen, Sergey Goncharov, Stefan Milius, Alexandra Silva Chair 8 (Theoretical Computer Science) 3
4 L A,B X := B X A Base Case: Moore Automata Moore automaton with input alphabet A and output alphabet B is given by t m : X A X (transition) and o m : X B (output) Put differently, a Moore automaton is a coalgebra m : X B X A on Set. A final L A,B -coalgebra is carried by the set B A of formal power series on B. Its coalgebra structure ι : B A B (B A ) A is given by o ι (σ : A B) = σ(ɛ) and t ι (σ : A B, a) = λw.σ(a w). Equivalently, the L A,B -coalgebra structure can be given in terms if derivatives: given w A, ɛ (σ) = o ι (σ) and a w (σ) = t ι ( w (σ), a) Particular important case is B = 2. Then B A P(A ) is the set of all formal languages over A. Erlangen, Sergey Goncharov, Stefan Milius, Alexandra Silva Chair 8 (Theoretical Computer Science) 4
5 L A,B X := B X A We shall assume finite Base Case: Moore Automata Moore automaton with input alphabet A and output alphabet B is given by t m : X A X (transition) and o m : X B (output) Put differently, a Moore automaton is a coalgebra m : X B X A on Set. A final L A,B -coalgebra is carried by the set B A of formal power series on B. Its coalgebra structure ι : B A B (B A ) A is given by o ι (σ : A B) = σ(ɛ) and t ι (σ : A B, a) = λw.σ(a w). Equivalently, the L A,B -coalgebra structure can be given in terms if derivatives: given w A, ɛ (σ) = o ι (σ) and a w (σ) = t ι ( w (σ), a) Particular important case is B = 2. Then B A P(A ) is the set of all formal languages over A. Erlangen, Sergey Goncharov, Stefan Milius, Alexandra Silva Chair 8 (Theoretical Computer Science) 5
6 Rationality of Formal Power Series By the the universal property of the final coalgebra for any m : X B X A there exists a unique L A,B -coalgebra homomorphism m such that: m X m B A B X A B m A B (B A ) A Given x X, x m := m(x) is the language recognized by m at x. A formal power series σ : A B is rational if the set { w (σ) w A } is finite. Theorem. A formal power series σ is rational iff σ = x m for some m : X B X A and x X. Erlangen, Sergey Goncharov, Stefan Milius, Alexandra Silva Chair 8 (Theoretical Computer Science) 6 ι
7 Expressions for Moore Automata Let σ : A B be rational, let A = {a 1,..., a n }, and let {σ 1,..., σ k } = { w (σ) w A }. Then σ = σ 1 can be found as the solution of system of recursive equations σ i = a 1.σ i1 a n.σ in c i, ( ) which should be read: for all i, j, aj (σ i ) = σ ij and σ i (ɛ) = c i. System ( ) uniquely determines the σ 1,..., σ n. Any recursive equation of ( ) can be rewritten as σ i = µσ i. (a 1.σ i1 a n.σ in c i ) where µ is the fixpoint operator binding the occurrences of σ i in the right term. One can successively eliminate σ i (i 1) and obtain a solution σ = t of ( ) in σ where t is a closed term given by γ ::= µx. (a 1.δ a n.δ B) δ ::= X γ Erlangen, Sergey Goncharov, Stefan Milius, Alexandra Silva Chair 8 (Theoretical Computer Science) 7
8 Expressions for Moore Automata Finite set of variables Let σ : A B be rational, let A = {a 1,..., a n }, and let {σ 1,..., σ k } = { w (σ) w A }. Then σ = σ 1 can be found as the solution of system of recursive equations σ i = a 1.σ i1 a n.σ in c i, ( ) which should be read: for all i, j, aj (σ i ) = σ ij and σ i (ɛ) = c i. System ( ) uniquely determines the σ 1,..., σ n. Any recursive equation of ( ) can be rewritten as σ i = µσ i. (a 1.σ i1 a n.σ in c i ) where µ is the fixpoint operator binding the occurrences of σ i in the right term. One can successively eliminate σ i (i 1) and obtain a solution σ = t of ( ) in σ where t is a closed term given by γ ::= µx. (a 1.δ a n.δ B) δ ::= X γ Erlangen, Sergey Goncharov, Stefan Milius, Alexandra Silva Chair 8 (Theoretical Computer Science) 8
9 Kleene s Theorem for Moore Automata Expressions γ ::= µx. (a 1.δ a n.δ B) δ ::= X γ faithfully represent all rational formal power series. We can introduce Brzozowski derivatives: given e = µx. (a 1.e 1 a n.e 1 c), let ai (e) = e i [e/x] o(e) = c By induction, let a w = a w. Then, let e (w) = o( w (e)). Brzozowski s theorem: for any expression e, { w (e) w A } is finite. Kleene s theorem: for any Moore automaton m and any state x X there is an expression e such that x m = e and converselly, for any expression e there are m and x such that x m = e. Erlangen, Sergey Goncharov, Stefan Milius, Alexandra Silva Chair 8 (Theoretical Computer Science) 9
10 Expressions for Deterministic FSM: Example B = 2 a a b start q 0 b q 1 a q 2 b e 0 = a.e 0 b.e 1 0 e 1 = a.e 0 b.e 2 0 e 2 = a.e 0 b.e 0 1 Hence: e 0 = µx.(a.x b.µy.(a.x b.µz.(a.x b.x 1) 0) 0) Equivalently: e 0 = (a + ba + b) b. Erlangen, Sergey Goncharov, Stefan Milius, Alexandra Silva Chair 8 (Theoretical Computer Science) 10
11 Powerset Construction Let m : X B (P ω X) A where B is a join-semilattice with bottom. We can extend it to m : m : P ω X B (P ω X) A by defining t m (s P ω X, a) = {t m (x, a) x s} o m (s P ω X) = x s o(x) Let x m = m{x}. m X {--} m P ω X m B A B (P ω X) A id ( m ) A B (B A ) A Theorem: x m is the formal power series accepted by m at state x X. ι Erlangen, Sergey Goncharov, Stefan Milius, Alexandra Silva Chair 8 (Theoretical Computer Science) 11
12 Equivalently given by t m : X A P ω X and o m : X B Powerset Construction Let m : X B (P ω X) A where B is a join-semilattice with bottom. We can extend it to m : m : P ω X B (P ω X) A by defining t m (s P ω X, a) = {t m (x, a) x s} o m (s P ω X) = x s o(x) Let x m = m{x}. m X {--} m P ω X m B A B (P ω X) A id ( m ) A B (B A ) A Theorem: x m is the formal power series accepted by m at state x X. ι Erlangen, Sergey Goncharov, Stefan Milius, Alexandra Silva Chair 8 (Theoretical Computer Science) 12
13 Generalized Powerset Construction and T-automata Definition: Let T be a monad. A T-automaton is triple of maps o m : X B, t m : X A TX, a m : TB B where the latter map satisfies the axioms of T-algebra. A T-automaton can be identified as a coalgebra m : X B (TX) A. Let Then t m (p, a) = do x p; t m (x, a) m X η m and we can define x m = η(x) m. o m (p) = a m (do x p; η(o m (x))). TX m B A B (TX) A id ( m ) A B (B A ) A ι Erlangen, Sergey Goncharov, Stefan Milius, Alexandra Silva Chair 8 (Theoretical Computer Science) 13
14 Algebraic Theories An algebraic theory is given by a signature Σ and a set of equations. Any algebraic theory E defines a monad: TX = set of Σ-terms over X modulo E ; η coerces a variable to a term; do x p; q substitutes each x in p : TX with q(x). Definition: We call a monad T finitely presented if it is generated by a finitely axiomatizable algebraic theory E over finite Σ. Example: Finite powerset monad P ω join semilattices with bottom. Finite state monad TX = (X S) S finite mnemoids (lookup l : X v X, update l,v : X X). Non-Example: Distribution monad (TX = set of finitely supported probability distributions ). Erlangen, Sergey Goncharov, Stefan Milius, Alexandra Silva Chair 8 (Theoretical Computer Science) 14
15 Delimited Stores Definition: Given a set S, let L be a nonempty meet-semilattice of equivalence relations of finite index on S. An L-delimited store monad is a submonad T of the store monad on S such that: for any L and any r, t : S (X S) TX, there exists L finer than such that t preserves and r sends -equivalent elements to equal. Examples: Stack monad: L consists of equivalences n on Γ identifying any s and s with the same n-prefixes. Dequeue monad: L consists of equivalences n,m on Γ identifying any s and s with the same n-prefixes and m-postfixes. Tape monad: L consists of equivalences n,m on Γ (Γ + 1) Γ identifying any s, x, t and s, x, t for which s and s have the same n-postfixes and t and t have the same m-prefixes. Erlangen, Sergey Goncharov, Stefan Milius, Alexandra Silva Chair 8 (Theoretical Computer Science) 15
16 Delimited Stores Finite tape alphabet Definition: Given a set S, let L be a nonempty meet-semilattice of equivalence relations of finite index on S. An L-delimited store monad is a submonad T of the store monad on S such that: for any L and any r, t : S (X S) TX, there exists L finer than such that t preserves and r sends -equivalent elements to equal. Examples: Stack monad: L consists of equivalences n on Γ identifying any s and s with the same n-prefixes. Dequeue monad: L consists of equivalences n,m on Γ identifying any s and s with the same n-prefixes and m-postfixes. Tape monad: L consists of equivalences n,m on Γ (Γ + 1) Γ identifying any s, x, t and s, x, t for which s and s have the same n-postfixes and t and t have the same m-prefixes. Erlangen, Sergey Goncharov, Stefan Milius, Alexandra Silva Chair 8 (Theoretical Computer Science) 16
17 Stack Automata For a stack monad T, TX (X Γ ) Γ consists of those state transformers r, t : Γ (X Γ ), for which r(u w) = r(u) t(u w) = t(u) w whenever u n for some n. The stack monad is finitely presentable w.r.t. pop : X Γ+1 X and push i : X X (i Γ ): push i (pop(x 1,..., x n, y)) = x i pop(push 1 (x),..., push n (x), x) = x pop(x 1,..., x n, pop(y 1,..., y n, z)) = pop(x 1,..., x n, z) For a deterministic stack automaton m : X 2 L[Γ ] TX a m is the w. p. transformer: for any s S and r, t : (2 L[Γ ] Γ ) Γ T (2 L[Γ ] ) a m (f )(s) = 1 iff s Γ. s t 1 (s ) r(s)(s ) = 1 Erlangen, Sergey Goncharov, Stefan Milius, Alexandra Silva Chair 8 (Theoretical Computer Science) 17
18 Stack Automata p 2 L[Γ ] iff it is stable under some n L For a stack monad T, TX (X Γ ) Γ consists of those state transformers r, t : Γ (X Γ ), for which r(u w) = r(u) t(u w) = t(u) w whenever u n for some n. The stack monad is finitely presentable w.r.t. pop : X Γ+1 X and push i : X X (i Γ ): push i (pop(x 1,..., x n, y)) = x i pop(push 1 (x),..., push n (x), x) = x pop(x 1,..., x n, pop(y 1,..., y n, z)) = pop(x 1,..., x n, z) For a deterministic stack automaton m : X 2 L[Γ ] TX a m is the w. p. transformer: for any s S and r, t : (2 L[Γ ] Γ ) Γ T (2 L[Γ ] ) a m (f )(s) = 1 iff s Γ. s t 1 (s ) r(s)(s ) = 1 Erlangen, Sergey Goncharov, Stefan Milius, Alexandra Silva Chair 8 (Theoretical Computer Science) 18
19 (Deterministic) Real-time CFL Deterministic real-time context-free languages are exactly those, which are recognized by deterministic real-time (with no internal transitions) push-down automata. Theorem. Let m be a stack automaton. Then for any x and any w Γ, x m (w) is a deterministic real-time CFL; and conversely: any deterministic real-time CFL can be obtained in this way. Conjecture. Real-time CFL (=proper CFL) are recognized exactly by non-deterministic stack automata. That is, automata over TX P ω (X Γ ) Γ, such that r, t : Γ P ω (X Γ ) TX iff r(u w) = r(u) whenever u n for some n. t(u w) = {u w u t(u)} Theorem. Given x X and m : X B TX A with finite B, x m is rational. Erlangen, Sergey Goncharov, Stefan Milius, Alexandra Silva Chair 8 (Theoretical Computer Science) 19
20 (Deterministic) Real-time CFL T = P ω stack monad over Γ Deterministic real-time context-free languages are exactly those, which are recognized by deterministic real-time (with no internal transitions) push-down automata. Theorem. Let m be a stack automaton. Then for any x and any w Γ, x m (w) is a deterministic real-time CFL; and conversely: any deterministic real-time CFL can be obtained in this way. Conjecture. Real-time CFL (=proper CFL) are recognized exactly by non-deterministic stack automata. That is, automata over TX P ω (X Γ ) Γ, such that r, t : Γ P ω (X Γ ) TX iff r(u w) = r(u) whenever u n for some n. t(u w) = {u w u t(u)} Theorem. Given x X and m : X B TX A with finite B, x m is rational. Erlangen, Sergey Goncharov, Stefan Milius, Alexandra Silva Chair 8 (Theoretical Computer Science) 20
21 Tensors Given two algebraic theories E 1 and E 2 their tensor E 1 E 2 is obtained by joining operations and equations and forcing tensor laws of the form f (g(x 1 1,..., x 1 m),..., g(x n 1,..., x n m)) = g(f (x 1 1,..., x n 1),..., f (x 1 m,..., x n m)) for any f : X n X from E 1 and any g : X m X from E 2. This induces tensor of monads; and if T 1 and T 2 are finitely presentable then so is T 1 T 2. Properties: T ( S) S yields state monad transformer T (X S) S. Tape monad is the tensor of stack monad with itself. Finite powermonad T P ω can be axiomatized in terms of unary operations, + and 0 due to tensor law f (x 1,..., x n ) = f (x 1,..., 0) f (0,..., x n ) Erlangen, Sergey Goncharov, Stefan Milius, Alexandra Silva Chair 8 (Theoretical Computer Science) 21
22 Effectful Fixpoint Expressions Let E be an algebraic theory over signature Σ corresponding to T. Given a finite A = {a 1,..., a n } and a T-algebra B effectful fixpoint expressions E B are closed terms γ given by the following grammar γ ::= µx. (a 1.δ a n.δ B) δ ::= X γ f (δ,..., δ) (f Σ) These form a Σ-algebra: given e k = µx. ( a 1.e k 1 a n.e k n bk), f (e 1,..., e m ) = µx. ( a 1.f (e 1 1,..., e m 1 ) a n.f (e 1 n,..., e m n ) f (b 1,..., b m ) ) but also a L A,B -coalgebra: o(µx. (a 1.e 1 a n.e n b)) = b ai (µx. (a 1.e 1 a n.e n b)) = e i [e/x] Let e e iff for all w A, o( w (e)) = o( w (e )). Erlangen, Sergey Goncharov, Stefan Milius, Alexandra Silva Chair 8 (Theoretical Computer Science) 22
23 Kleene s Theorem for Effectful Fixpoint Expressions Given e E T,B and w A, let e (w) = o( w (e)). Conjecture (Kleene s Theorem): for any T-automaton with a finitely presentable T and any x X there is e E T,B such that x m = e. Conversely, for any e E T,B there is m and x X, such that x m = e. Conjecture: is properly Π 0 1 (by reduction to CFL). Conjecture: Let T be the tensor product of n instances of the stack monad and let m be a delimited store monad over T. Then deciding if w e m is linear time. Deciding if w e m with T replaced by T P ω is nondeterministic linear time. Open Question: Does it generalize to any delimited store monad? Erlangen, Sergey Goncharov, Stefan Milius, Alexandra Silva Chair 8 (Theoretical Computer Science) 23
24 Push-down Expressions Push-down expressions are effectful fixpoint expressions for nondeterministic stack automata. Concretely, γ ::= 0 µx. ξ π ξ ::= a.δ a.δ + ξ a.δ + π π ::= pop s (π) empty(0) empty(1) δ ::= X γ pop s (δ) push s (δ) empty(δ) Example: Consider CFG (in Greibach normal form): X axx X b This corresponds to expression µx. (a.push c (x) + b.pop c (x) + b.empty(1)) Erlangen, Sergey Goncharov, Stefan Milius, Alexandra Silva Chair 8 (Theoretical Computer Science) 24
25 Thank You for Your Attention!
26 Myers, R. (2013). Rational Coalgebraic Machines in Varieties: Languages, Completeness and Automatic Proofs. PhD thesis, Imperial College London. Rutten, J. J. M. M. (1998). Automata and coinduction (an exercise in coalgebra). In Sangiorgi, D. and de Simone, R., editors, CONCUR, volume 1466 of Lecture Notes in Computer Science, pages Springer. Silva, A. (2010). Kleene coalgebra. PhD thesis, Radboud Universiteit Nijmegen. Erlangen, Sergey Goncharov, Stefan Milius, Alexandra Silva Chair 8 (Theoretical Computer Science) 26
27 Silva, A., Bonchi, F., Bonsangue, M. M., and Rutten, J. J. M. M. (2010). Generalizing the powerset construction, coalgebraically. In FSTTCS, volume 8 of LIPIcs, pages Winter, J., Bonsangue, M. M., and Rutten, J. J. M. M. (2013). Coalgebraic characterizations of context-free languages. Logical Methods in Computer Science, 9, abs/ (3). Erlangen, Sergey Goncharov, Stefan Milius, Alexandra Silva Chair 8 (Theoretical Computer Science) 27
Weighted automata coalgebraically
Weighted automata coalgebraically Filippo Bonchi 4 Michele Boreale 5 Marcello Bonsangue,2 Jan Rutten,3 Alexandra Silva Centrum Wiskunde en Informatica 2 LIACS - Leiden University 3 Radboud Universiteit
More informationContext-Free Languages, Coalgebraically
Context-Free Languages, Coalgebraically Joost Winter 1, Marcello M. Bonsangue 2,1, and Jan Rutten 1,3 1 Centrum Wiskunde & Informatica (CWI) 2 LIACS Leiden University 3 Radboud University Nijmegen Abstract.
More informationStreams and Coalgebra Lecture 2
Streams and Coalgebra Lecture 2 Helle Hvid Hansen and Jan Rutten Radboud University Nijmegen & CWI Amsterdam Representing Streams II, Lorentz Center, Leiden, January 2014 Tutorial Overview Lecture 1 (Hansen):
More informationRealization of Coinductive Types
MFPS 2011 Realization of Coinductive Types Dexter Kozen 1,2 Department of Computer Science Cornell University Ithaca, New York 14853 7501, USA Abstract We give an explicit combinatorial construction of
More informationLecture 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
More informationProduct rules and distributive laws
Product rules and distributive laws Joost Winter University of Warsaw April 2, 2016 Overview Main goal of this paper: a categorical framework for a two-step determinization process in which product rules,
More informationStreams and Coalgebra Lecture 1
Streams and Coalgebra Lecture 1 Helle Hvid Hansen and Jan Rutten Radboud University Nijmegen & CWI Amsterdam Representing Streams II, Lorentz Center, Leiden, January 2014 Tutorial Overview Lecture 1 (Hansen):
More informationChomsky and Greibach Normal Forms
Chomsky and Greibach Normal Forms Teodor Rus rus@cs.uiowa.edu The University of Iowa, Department of Computer Science Computation Theory p.1/25 Simplifying a CFG It is often convenient to simplify CFG One
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 informationTowards Trace Metrics via Functor Lifting
Towards Trace Metrics via Functor Lifting Paolo Baldan 1,Filippo Bonchi 2, Henning Kerstan 3 and Barbara König 3 1 Università di Padova, Italy 2 CNRS, ENS Lyon, Université de Lyon, France 3 Universität
More informationHarvard CS 121 and CSCI E-207 Lecture 10: Ambiguity, Pushdown Automata
Harvard CS 121 and CSCI E-207 Lecture 10: Ambiguity, Pushdown Automata Salil Vadhan October 4, 2012 Reading: Sipser, 2.2. Another example of a CFG (with proof) L = {x {a, b} : x has the same # of a s and
More informationPushdown Automata (Pre Lecture)
Pushdown Automata (Pre Lecture) Dr. Neil T. Dantam CSCI-561, Colorado School of Mines Fall 2017 Dantam (Mines CSCI-561) Pushdown Automata (Pre Lecture) Fall 2017 1 / 41 Outline Pushdown Automata Pushdown
More informationIntroduction to Formal Languages, Automata and Computability p.1/42
Introduction to Formal Languages, Automata and Computability Pushdown Automata K. Krithivasan and R. Rama Introduction to Formal Languages, Automata and Computability p.1/42 Introduction We have considered
More informationCS481F01 Prelim 2 Solutions
CS481F01 Prelim 2 Solutions A. Demers 7 Nov 2001 1 (30 pts = 4 pts each part + 2 free points). For this question we use the following notation: x y means x is a prefix of y m k n means m n k For each of
More informationPushdown Automata (2015/11/23)
Chapter 6 Pushdown Automata (2015/11/23) Sagrada Familia, Barcelona, Spain Outline 6.0 Introduction 6.1 Definition of PDA 6.2 The Language of a PDA 6.3 Euivalence of PDA s and CFG s 6.4 Deterministic PDA
More informationEquational 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
More informationContext-Free Languages
CS:4330 Theory of Computation Spring 2018 Context-Free Languages Pushdown Automata Haniel Barbosa Readings for this lecture Chapter 2 of [Sipser 1996], 3rd edition. Section 2.2. Finite automaton 1 / 13
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 informationHalting and Equivalence of Schemes over Recursive Theories
Halting and Equivalence of Schemes over Recursive Theories Dexter Kozen Computer Science Department, Cornell University, Ithaca, New York 14853-7501, USA Abstract Let Σ be a fixed first-order signature.
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 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 informationCoinductive Proof Techniques for Language Equivalence
Coinductive Proof Techniques for Language Equivalence Jurriaan Rot 1,2,, Marcello Bonsangue 1,2, and Jan Rutten 2,3 1 LIACS Leiden University, Niels Bohrweg 1, Leiden, Netherlands 2 Centrum Wiskunde en
More informationCSE 105 THEORY OF COMPUTATION
CSE 105 THEORY OF COMPUTATION Spring 2017 http://cseweb.ucsd.edu/classes/sp17/cse105-ab/ Review of CFG, CFL, ambiguity What is the language generated by the CFG below: G 1 = ({S,T 1,T 2 }, {0,1,2}, { S
More informationPushdown Automata: Introduction (2)
Pushdown Automata: Introduction Pushdown automaton (PDA) M = (K, Σ, Γ,, s, A) where K is a set of states Σ is an input alphabet Γ is a set of stack symbols s K is the start state A K is a set of accepting
More informationThe Pumping Lemma. for all n 0, u 1 v n u 2 L (i.e. u 1 u 2 L, u 1 vu 2 L [but we knew that anyway], u 1 vvu 2 L, u 1 vvvu 2 L, etc.
The Pumping Lemma For every regular language L, there is a number l 1 satisfying the pumping lemma property: All w L with w l can be expressed as a concatenation of three strings, w = u 1 vu 2, where u
More informationPush-down Automata = FA + Stack
Push-down Automata = FA + Stack PDA Definition A push-down automaton M is a tuple M = (Q,, Γ, δ, q0, F) where Q is a finite set of states is the input alphabet (of terminal symbols, terminals) Γ is the
More informationTHE AUSTRALIAN NATIONAL UNIVERSITY Second Semester COMP2600/COMP6260 (Formal Methods for Software Engineering)
THE AUSTRALIAN NATIONAL UNIVERSITY Second Semester 2016 COMP2600/COMP6260 (Formal Methods for Software Engineering) Writing Period: 3 hours duration Study Period: 15 minutes duration Permitted Materials:
More informationChomsky Normal Form and TURING MACHINES. TUESDAY Feb 4
Chomsky Normal Form and TURING MACHINES TUESDAY Feb 4 CHOMSKY NORMAL FORM A context-free grammar is in Chomsky normal form if every rule is of the form: A BC A a S ε B and C aren t start variables a is
More informationDuality in Probabilistic Automata
Duality in Probabilistic Automata Chris Hundt Prakash Panangaden Joelle Pineau Doina Precup Gavin Seal McGill University MFPS May 2006 Genoa p.1/40 Overview We have discovered an - apparently - new kind
More informationPartially ordered monads and powerset Kleene algebras
Partially ordered monads and powerset Kleene algebras Patrik Eklund 1 and Werner Gähler 2 1 Umeå University, Department of Computing Science, SE-90187 Umeå, Sweden peklund@cs.umu.se 2 Scheibenbergstr.
More informationFORMAL LANGUAGES, AUTOMATA AND COMPUTABILITY
15-453 FORMAL LANGUAGES, AUTOMATA AND COMPUTABILITY Chomsky Normal Form and TURING MACHINES TUESDAY Feb 4 CHOMSKY NORMAL FORM A context-free grammar is in Chomsky normal form if every rule is of the form:
More informationHalting and Equivalence of Program Schemes in Models of Arbitrary Theories
Halting and Equivalence of Program Schemes in Models of Arbitrary Theories Dexter Kozen Cornell University, Ithaca, New York 14853-7501, USA, kozen@cs.cornell.edu, http://www.cs.cornell.edu/~kozen In Honor
More informationFinite Automata Theory and Formal Languages TMV027/DIT321 LP4 2018
Finite Automata Theory and Formal Languages TMV027/DIT321 LP4 2018 Lecture 15 Ana Bove May 17th 2018 Recap: Context-free Languages Chomsky hierarchy: Regular languages are also context-free; Pumping lemma
More informationCPS 220 Theory of Computation Pushdown Automata (PDA)
CPS 220 Theory of Computation Pushdown Automata (PDA) Nondeterministic Finite Automaton with some extra memory Memory is called the stack, accessed in a very restricted way: in a First-In First-Out fashion
More informationCoalgebra, lecture 10: Algebra and Coalgebra for Regular Expressions
Coalgebra, lecture 10: Algebra and Coalgebra for Regular Expressions Jurriaan Rot November 19, 2018 By now we ve been talking a lot about coalgebras and coinduction, as well as algebras and induction.
More informationPreliminaries. Chapter 3
Chapter 3 Preliminaries In the previous chapter, we studied coinduction for languages and deterministic automata. Deterministic automata are a special case of the theory of coalgebras, which encompasses
More informationSCHEME FOR INTERNAL ASSESSMENT TEST 3
SCHEME FOR INTERNAL ASSESSMENT TEST 3 Max Marks: 40 Subject& Code: Automata Theory & Computability (15CS54) Sem: V ISE (A & B) Note: Answer any FIVE full questions, choosing one full question from each
More informationPlease give details of your answer. A direct answer without explanation is not counted.
Please give details of your answer. A direct answer without explanation is not counted. Your answers must be in English. Please carefully read problem statements. During the exam you are not allowed to
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 informationHarvard CS 121 and CSCI E-207 Lecture 10: CFLs: PDAs, Closure Properties, and Non-CFLs
Harvard CS 121 and CSCI E-207 Lecture 10: CFLs: PDAs, Closure Properties, and Non-CFLs Harry Lewis October 8, 2013 Reading: Sipser, pp. 119-128. Pushdown Automata (review) Pushdown Automata = Finite automaton
More informationCompleteness for coalgebraic µ-calculus: part 2. Fatemeh Seifan (Joint work with Sebastian Enqvist and Yde Venema)
Completeness for coalgebraic µ-calculus: part 2 Fatemeh Seifan (Joint work with Sebastian Enqvist and Yde Venema) Overview Overview Completeness of Kozen s axiomatisation of the propositional µ-calculus
More informationNPDA, CFG equivalence
NPDA, CFG equivalence Theorem A language L is recognized by a NPDA iff L is described by a CFG. Must prove two directions: ( ) L is recognized by a NPDA implies L is described by a CFG. ( ) L is described
More information1. The Method of Coalgebra
1. The Method of Coalgebra Jan Rutten CWI Amsterdam & Radboud University Nijmegen IMS, Singapore - 15 September 2016 Overview of Lecture one 1. Category theory (where coalgebra comes from) 2. Algebras
More informationIntroduction 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)
More informationTheory 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
More informationOutline. CS21 Decidability and Tractability. Machine view of FA. Machine view of FA. Machine view of FA. Machine view of FA.
Outline CS21 Decidability and Tractability Lecture 5 January 16, 219 and Languages equivalence of NPDAs and CFGs non context-free languages January 16, 219 CS21 Lecture 5 1 January 16, 219 CS21 Lecture
More informationHomework 8. a b b a b a b. two-way, read/write
Homework 8 309 Homework 8 1. Describe a TM that accepts the set {a n n is a power of 2}. Your description should be at the level of the descriptions in Lecture 29 of the TM that accepts {ww w Σ } and the
More informationCSE 105 THEORY OF COMPUTATION
CSE 105 THEORY OF COMPUTATION Spring 2016 http://cseweb.ucsd.edu/classes/sp16/cse105-ab/ Today's learning goals Sipser Ch 2 Define push down automata Trace the computation of a push down automaton Design
More informationClasses and conversions
Classes and conversions Regular expressions Syntax: r = ε a r r r + r r Semantics: The language L r of a regular expression r is inductively defined as follows: L =, L ε = {ε}, L a = a L r r = L r L r
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 informationThis article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and
This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and education use, including for instruction at the authors institution
More informationHomework. Context Free Languages. Announcements. Before We Start. Languages. Plan for today. Final Exam Dates have been announced.
Homework Context Free Languages PDAs and CFLs Homework #3 returned Homework #4 due today Homework #5 Pg 169 -- Exercise 4 Pg 183 -- Exercise 4c,e,i (use JFLAP) Pg 184 -- Exercise 10 Pg 184 -- Exercise
More informationOctober 6, Equivalence of Pushdown Automata with Context-Free Gramm
Equivalence of Pushdown Automata with Context-Free Grammar October 6, 2013 Motivation Motivation CFG and PDA are equivalent in power: a CFG generates a context-free language and a PDA recognizes a context-free
More informationMA/CSSE 474 Theory of Computation
MA/CSSE 474 Theory of Computation CFL Hierarchy CFL Decision Problems Your Questions? Previous class days' material Reading Assignments HW 12 or 13 problems Anything else I have included some slides online
More informationTheory of Computation Turing Machine and Pushdown Automata
Theory of Computation Turing Machine and Pushdown Automata 1. What is a Turing Machine? A Turing Machine is an accepting device which accepts the languages (recursively enumerable set) generated by type
More information1. (a) Explain the procedure to convert Context Free Grammar to Push Down Automata.
Code No: R09220504 R09 Set No. 2 II B.Tech II Semester Examinations,December-January, 2011-2012 FORMAL LANGUAGES AND AUTOMATA THEORY Computer Science And Engineering Time: 3 hours Max Marks: 75 Answer
More informationPushdown Automata. Pushdown Automata. Pushdown Automata. Pushdown Automata. Pushdown Automata. Pushdown Automata. The stack
A pushdown automata (PDA) is essentially: An NFA with a stack A move of a PDA will depend upon Current state of the machine Current symbol being read in Current symbol popped off the top of the stack With
More informationNotes on generating functions in automata theory
Notes on generating functions in automata theory Benjamin Steinberg December 5, 2009 Contents Introduction: Calculus can count 2 Formal power series 5 3 Rational power series 9 3. Rational power series
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 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 informationTowards Kleene Algebra with Recursion
Towards Kleene Algebra with Recursion Hans Leiß Universität München, CIS Leopoldstraße 139 D-8000 München 40 leiss@sparc1.cis.uni-muenchen.de Abstract We extend Kozen s theory KA of Kleene Algebra to axiomatize
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 informationConstructing the Lindenbaum algebra for a logic step-by-step using duality (extended version)
Constructing the Lindenbaum algebra for a logic step-by-step using duality (extended version) Dion Coumans and Sam van Gool Abstract We discuss the incremental construction of the Lindenbaum algebra for
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 informationCS481F01 Solutions 6 PDAS
CS481F01 Solutions 6 PDAS A. Demers 2 November 2001 1. Give a NPDAs that recognize the following languages: (a) The set of all strings in {0, 1} that contain twice as many 1s as 0s. (answer a) We build
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 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 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 informationAutomata 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
More informationCSE 105 THEORY OF COMPUTATION
CSE 105 THEORY OF COMPUTATION Spring 2016 http://cseweb.ucsd.edu/classes/sp16/cse105-ab/ Today's learning goals Sipser Ch 3.3, 4.1 State and use the Church-Turing thesis. Give examples of decidable problems.
More informationUNIT-VI PUSHDOWN AUTOMATA
Syllabus R09 Regulation UNIT-VI PUSHDOWN AUTOMATA The context free languages have a type of automaton that defined them. This automaton, called a pushdown automaton, is an extension of the nondeterministic
More informationThe Final Deterministic Automaton on Streams
The Final Deterministic Automaton on Streams Helle Hvid Hansen Clemens Kupke Jan Rutten Joost Winter Radboud Universiteit Nijmegen & CWI Amsterdam Brouwer seminar, 29 April 2014 Overview 1. Automata, streams
More informationPushdown Automata (PDA) The structure and the content of the lecture is based on
Pushdown Automata (PDA) The structure and the content of the lecture is based on http://www.eecs.wsu.edu/~ananth/cpts317/lectures/index.htm 1 Excursion: Previous lecture n Context-free grammar G=(V,T,P,S),
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 informationEquivalence of Regular Expressions and FSMs
Equivalence of Regular Expressions and FSMs Greg Plaxton Theory in Programming Practice, Spring 2005 Department of Computer Science University of Texas at Austin Regular Language Recall that a language
More information(b) If G=({S}, {a}, {S SS}, S) find the language generated by G. [8+8] 2. Convert the following grammar to Greibach Normal Form G = ({A1, A2, A3},
Code No: 07A50501 R07 Set No. 2 III B.Tech I Semester Examinations,MAY 2011 FORMAL LANGUAGES AND AUTOMATA THEORY Computer Science And Engineering Time: 3 hours Max Marks: 80 Answer any FIVE Questions All
More information(pp ) PDAs and CFGs (Sec. 2.2)
(pp. 117-124) PDAs and CFGs (Sec. 2.2) A language is context free iff all strings in L can be generated by some context free grammar Theorem 2.20: L is Context Free iff a PDA accepts it I.e. if L is context
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 informationLecture 17: Language Recognition
Lecture 17: Language Recognition Finite State Automata Deterministic and Non-Deterministic Finite Automata Regular Expressions Push-Down Automata Turing Machines Modeling Computation When attempting to
More informationThe Post Correspondence Problem
The Post Correspondence Problem - Given a set, P of pairs of strings: where t i, b i Σ P = {[ t 1 b 1 ], t 2 b 2 ],, t k b k ]} - Question: Does there exist a sequence i 1, i 2, i n such that: t i1 t i2
More informationEinführung in die Computerlinguistik
Einführung in die Computerlinguistik Context-Free Grammars (CFG) Laura Kallmeyer Heinrich-Heine-Universität Düsseldorf Summer 2016 1 / 22 CFG (1) Example: Grammar G telescope : Productions: S NP VP NP
More informationHow to Pop a Deep PDA Matters
How to Pop a Deep PDA Matters Peter Leupold Department of Mathematics, Faculty of Science Kyoto Sangyo University Kyoto 603-8555, Japan email:leupold@cc.kyoto-su.ac.jp Abstract Deep PDA are push-down automata
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 informationSt.MARTIN S ENGINEERING COLLEGE Dhulapally, Secunderabad
St.MARTIN S ENGINEERING COLLEGE Dhulapally, Secunderabad-500 014 Subject: FORMAL LANGUAGES AND AUTOMATA THEORY Class : CSE II PART A (SHORT ANSWER QUESTIONS) UNIT- I 1 Explain transition diagram, transition
More informationAutomata Theory - Quiz II (Solutions)
Automata Theory - Quiz II (Solutions) K. Subramani LCSEE, West Virginia University, Morgantown, WV {ksmani@csee.wvu.edu} 1 Problems 1. Induction: Let L denote the language of balanced strings over Σ =
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 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 informationThe Idea of a Pushdown Automaton
Pushdown Automata 5DV037 Fundamentals of Computer Science Umeå University Department of Computing Science Stephen J. Hegner hegner@cs.umu.se http://www.cs.umu.se/~hegner The Idea of a Pushdown Automaton
More informationA [Monad-Based] Semantics for Hybrid Iteration
A [Monad-Based] Semantics for Hybrid Iteration Sergey Goncharov a Julian Jakob a Renato Neves b CONCUR 2018, September 4-7, Beijing a Friedrich-Alexander-Universität Erlangen-Nürnberg b INESC TEC (HASLab)
More informationTesting Semantics: Connecting Processes and Process Logics
Testing Semantics: Connecting Processes and Process Logics Dusko Pavlovic, 1,4 Michael Mislove 2,4 and James B. Worrell 3 1 Kestrel Institute, Palo Alto, CA 2 Tulane University, New Orleans, LA 3 Oxford
More informationCISC4090: Theory of Computation
CISC4090: Theory of Computation Chapter 2 Context-Free Languages Courtesy of Prof. Arthur G. Werschulz Fordham University Department of Computer and Information Sciences Spring, 2014 Overview In Chapter
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 informationRegularity Problems for Visibly Pushdown Languages
Regularity Problems for Visibly Pushdown Languages Vince Bárány 1, Christof Löding 1, and Olivier Serre 2 1 RWTH Aachen, Germany 2 LIAFA, Université Paris VII & CNRS, France Abstract. Visibly pushdown
More informationIntroduction to Theory of Computing
CSCI 2670, Fall 2012 Introduction to Theory of Computing Department of Computer Science University of Georgia Athens, GA 30602 Instructor: Liming Cai www.cs.uga.edu/ cai 0 Lecture Note 3 Context-Free Languages
More informationDeterministic Finite Automata. Non deterministic finite automata. Non-Deterministic Finite Automata (NFA) Non-Deterministic Finite Automata (NFA)
Deterministic Finite Automata Non deterministic finite automata Automata we ve been dealing with have been deterministic For every state and every alphabet symbol there is exactly one move that the machine
More informationDistributive laws for the Coinductive Solution of Recursive Equations
Distributive laws for the Coinductive Solution of Recursive Equations Bart Jacobs Institute for Computing and Information Sciences, Radboud University Nijmegen P.O. Box 9010, 6500 GL Nijmegen, The Netherlands
More informationCFGs and PDAs are Equivalent. We provide algorithms to convert a CFG to a PDA and vice versa.
CFGs and PDAs are Equivalent We provide algorithms to convert a CFG to a PDA and vice versa. CFGs and PDAs are Equivalent We now prove that a language is generated by some CFG if and only if it is accepted
More informationC6.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
More informationEinführung in die Computerlinguistik
Einführung in die Computerlinguistik Context-Free Grammars formal properties Laura Kallmeyer Heinrich-Heine-Universität Düsseldorf Summer 2018 1 / 20 Normal forms (1) Hopcroft and Ullman (1979) A normal
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 information