Product rules and distributive laws
|
|
- Isaac Crawford
- 5 years ago
- Views:
Transcription
1 Product rules and distributive laws Joost Winter University of Warsaw April 2, 2016
2 Overview Main goal of this paper: a categorical framework for a two-step determinization process in which product rules, such as Brzozowski s rule (xy) a = x a y + o(x)y a, or the familiar Leibniz rule from calculus (xy) a = x a y + xy a, can be understood. First step (transforming a FST -coalgebra into a FS-coalgebra) is given by the product rule. Second step (transforming a FS-coalgebra into a F -coalgebra) is the usual determinization/linearization for weighted automata. We provide a general perspective on this process, including a coherence condition giving a sufficient condition for the two-step determinization process to be possible.
3 Distributive laws Given: 1. A monad (T, η T, µ T ). 2. Either a monad (S, η S, µ S ), an endofunctor S or a copointed endofunctor (S, ɛ). a. λ η T S = Sη T c. λ µ T S = Sµ T λt T λ b. λ T η S = η S T d. λ T µ S = µ S T Sλ λs e. ɛt λ = T ɛ A distributive law between monads satisfies a., b., c., and d. A distributive law of a monad over an endofunctor satisfies a. and c. A distributive law of a monad over a copointed endofunctor satisfies a., c., and e.
4 Product rules three examples (frequently featured in work by Rutten and many others as coinductive definitions) Brzozowski rule convolution product: o(1) = 1 1 a = 0 o(xy) = o(x)o(y) (xy) a = x a y + o(x)y a Leibniz rule shuffle product: o(1) = 1 1 a = 0 o(x y) = o(x)o(y) (x y) a = x a y + x y a Pointwise rule Hadamard product: o(1) = 1 1 a = 1 o(x y) = o(x)o(y) (x y) a = x a y a
5 Deteriminizing a nondeterministic automaton, bialgebraically X η X P ω (X ) P(A ) (o, δ) 2 P ω (X ) A (ô, ˆδ) (O, ) 2 A 2 P ω (X ) A Categorically well-understood (see e.g. the work by Bartels, Jacobs/Silva/Sokolova and many others) via bialgebras and distributive laws. (ô, ˆδ) can be obtained from (o, δ) using the distributive law.
6 The general picture X η X TX νf δ ˆδ F FTX F νf Given a distributive law λ : TF FT (monad over endofunctor) the extension ˆδ is obtained by: ˆδ = F µ X λtx T δ The distributive law can be seen as defining a T -algebra structure on the final F -coalgebra.
7 Determinization for context-free languages (one step) X η X P ω (X ) P(A ) (o, δ) 2 P ω (X ) A (ô, ˆδ) (O, ) 2 A 2 P ω (X ) A Various variants, most involving a distributive law of a monad over a (cofree) copointed functor. See e.g. Winter/Bonsangue/Rutten, and Bonsangue/Hansen/Kurz/Rot. Can also be generalized from (context-free) languages to (constructively) algebraic power series. When we regard the distributive law as defining an algebra structure on the final coalgebra, we can see it also as defining the convolution product on power series (together with linearity of derivative). Similarly, there are laws for the shuffle and Hadamard products/product rules.
8 Determinization for context-free languages (two steps) X η 0 X X η 1 X P ω (X ) P(A ) (o, δ) 2 P ω (X ) A (o, δ )(ô, ˆδ) (O, ) 2 A 2 P ω (X ) A This can again be generalized from languages to power series. But, can we understand this diagram categorically, too?
9 Semimodules and algebras for a semiring Given a semiring (S, 0, 1,, ), a (left) S-semimodule is a tuple (X, 0, +, ): 1. (X, 0, +) is a commutative monoid, 2. : S X X (left-scalar product) satisfies: (s t) x = s x + t x 0 x = 0 s (x + y) = s x + s y s 0 = 0 s (t x) = (st) x 1 x = x Given a commutative semiring S, a (unital, associative) S-algebra (see e.g. Eilenberg 1974) is a tuple (X, 0, 1, +,, ): 1. (X, 0, 1, +, ) is a semiring. 2. (X, 0, +, ) is a S-semimodule. 3. Satisfying: s (xy) = (s x)y = x(s y).
10 ... via distributive laws (between monads) Recall: 1. Algebras for the monad are monoids. 2. Algebras for the monad Lin S defined by Lin S (X ) = {f S X supp(f ) is finite} with the expected (see e.g. Jacobs/Silva/Sokolova 2012) multiplication (on the left/right) are left/right S-semimodules. If S is commutative, there is a distributive law of over Lin S, creating a monad structure on S := Lin S ( ). Its algebras are the S-algebras as just defined.
11 ... via distributive laws (between monads) (2) The distributive law λ : (Lin S ( )) Lin K ( ) can be given by: ( n ) ( m i m 1 m n n ) n λ X k ij x ij = k iji x iji i=1 j=1 j 1 =1 j n=1 i=1 i=1 (see e.g. Beck 69 for the case S = Z) S S-semimodules S-algebras B (join) semilattices idempotent semirings N commutative monoids semirings Z Abelian groups rings
12 Combining distributive laws (acc. to Cheng) Let S, T, and U be monads, and let λ 0 : UT TU, λ 1 : US SU, and λ 2 : TS ST be distributive laws. Theorem T.f.a.e.: 1. The diagram of natural transformations UTS Uλ 2 UST λ1 T SUT λ 0 S Sλ 0 T λ 1 TUS TSU λ2 U STU (the Yang Baxter diagram) commutes. 2. λ 2 U T λ 1 is a dist. law of the composite monad TU over S. 3. Sλ 0 λ 1 T is a dist. law of U over the composite monad ST.
13 Same result for dist. laws over endofunctors Now, let S and T be monads, and F and endofunctor... λ 0 dist. law between monads, λ 1 and λ 2 dist. law of monad over endofunctor Theorem T.f.a.e.: 1. The diagram of natural transformations TSF T λ 2 TFS λ 1 S FTS λ 0 F F λ 0 Sλ 1 STF SFT λ2 T FST (the Yang Baxter diagram) commutes. 2. λ 2 T Sλ 1 is a dist. law of the composite monad ST over F. (also works for copointed)
14 Instance: the Hadamard product We can use the framework of the previous page with the following instances (assume S to be commutative): S = Lin S ( ), the monad for S-semimodules T =, the list monad F = S A, the endofunctor for Moore machines with output in S. Take λ 0 : TS ST as defined before (making ST the monad for S-algebras), make λ 2 the pointwise distributive law for S-weighted automata, and define λ 1 : (S A ) (S ( ) A ) again pointwise, as follows: λ 1 (ɛ) = (1 S, (a ε)) λ 1 ((o, a d a )w) = let (p, a e a ) = λ 1 (w) in (op, a d a e a )
15 How about convolution and shuffle product λ 1 in the previous slide can be seen as defining, coinductively, the product rule 1 a = 1, (xy) a = x a y a on the final coalgebra. How about other rules, such as (xy) a = x a y + o(x)y a or (xy) a = xa y + xy a?
16 How about convolution and shuffle product λ 1 in the previous slide can be seen as defining, coinductively, the product rule 1 a = 1, (xy) a = x a y a on the final coalgebra. How about other rules, such as (xy) a = x a y + o(x)y a or (xy) a = xa y + xy a? Because of the presence of addition on the right hand side of the equations, it seems this will not work, and we need a law of the type λ : TF FST
17 Distributive laws into a composite monad Given: 1. A monad (T, η T, µ T ), a monad (S, η S, µ S ), a distributive law between monads λ 0 : TS ST, and an endofunctor F, A natural transformation λ : TF FST is a distributive law of T over F into the composite monad ST whenever: λ η T F = F η ST λ µ T F = F µ ST λst T λ If (F, ɛ) is a copointed endofunctor, additionally: ɛst λ = η S T ɛ
18 The other two product rules Brzozowski/convolution rule: λ X (1) = (1, 1, a 0) λ X (x, o, a d a )w = let (y, p, a e a ) = λ X (w) in (xy, op, a d a y + oe a ) Leibniz/shuffle rule: λ X (1) = (1, 1, a 0) λ X (x, o, a d a )w = let (y, p, a e a ) = λ X (w) in (xy, op, a d a y + xe a )
19 Another coherence condition (1) TSF T λ 2 TFS λ 1 S FSTS FSλ0 FSST λ 0 F F µ S T STF Sλ 1 SFST λ2 ST FSST F µs T FST Theorem Given monads (T, η T, µ T ) and (S, η S, µ S ), and an endofunctor F such that: λ 0 is a distributive law of the monad T over the monad S. λ 1 is a distributive law of the monad T over the endofunctor F into the composite monad ST... λ 2 is a distributive law of the monad S over the endofunctor F.
20 Another coherence condition (1) TSF T λ 2 TFS λ 1 S FSTS FSλ0 FSST λ 0 F F µ S T STF Theorem... ˆλ : STF FST, given by Sλ 1 SFST λ2 ST FSST F µs T FST STF Sλ1 SFST λ2 ST FSST F µs T FST is a distributive law of the composite monad ST over F iff the coherence condition holds. (again works for copointed)
21 Two-step determinization: general X η T X TX η S TX STX νf δ δ ˆδ FSTX F F νf δ and ˆδ can now be expressed in terms of the various distributive laws and δ: δ = F µ ST X λ1 STX T δ ˆδ = F µ S TX λ2 STX Sδ δ can also be obtained, equivalently, in terms of the distributive law ˆλ of ST over F.
22 Future work (maybe almost trivial?) One possibly fascinating question is the following: can you use a similar generalization to the one given in this paper for distributive laws between monads into composite monads, so as to give a more general version of Cheng s result in the original setting?
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
More information(Co-)algebraic Automata Theory
(Co-)algebraic Automata Theory Sergey Goncharov, Stefan Milius, Alexandra Silva Erlangen, 5.11.2013 Chair 8 (Theoretical Computer Science) Short Histrory of Coalgebraic Invasion to Automata Theory Deterministic
More informationEndomorphism Semialgebras in Categorical Quantum Mechanics
Endomorphism Semialgebras in Categorical Quantum Mechanics Kevin Dunne University of Strathclyde November 2016 Symmetric Monoidal Categories Definition A strict symmetric monoidal category (A,, I ) consists
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 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 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 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 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 informationInjective objects and lax idempotent monads
Master Project Injective objects and lax idempotent monads Author: Eiichi Piguet Supervised by: Dr. Gavin Jay Seal Autumn 2013 eiichi.piguet@epfl.ch i Acknowledgement I would like to express my deepest
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 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 informationNotes on Semigroups. Uday S. Reddy. March 14, 2014
Notes on Semigroups Uday S. Reddy March 14, 2014 Semigroups are everywhere. Groups are semigroups with a unit and inverses. Rings are double semigroups: an inner semigroup that is required to be a commutative
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 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 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 informationarxiv: v1 [math.qa] 9 Feb 2009
Compatibility of (co)actions and localizations Zoran Škoda, zskoda@irb.hr preliminary version arxiv:0902.1398v1 [math.qa] 9 Feb 2009 Earlier, Lunts and Rosenberg studied a notion of compatibility of endofunctors
More information(2017) : 13 (1) ISSN , /LMCS-13(1:3)2017
Hansen, Helle Hvid and Kupke, Clemens and Rutten, Jan (2017) Stream differential equations : specification formats and solution methods. Logical Methods in Computer Science, 13 (1). pp. 1-52. ISSN 1860-5974,
More informationMonads Need Not Be Endofunctors
Monads Need Not Be Endofunctors Thorsten Altenkirch, University of Nottingham James Chapman, Institute of Cybernetics, Tallinn Tarmo Uustalu, Institute of Cybernetics, Tallinn ScotCats, Edinburgh, 21 May
More informationDEFINITIONS: OPERADS, ALGEBRAS AND MODULES. Let S be a symmetric monoidal category with product and unit object κ.
DEFINITIONS: OPERADS, ALGEBRAS AND MODULES J. P. MAY Let S be a symmetric monoidal category with product and unit object κ. Definition 1. An operad C in S consists of objects C (j), j 0, a unit map η :
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 informationWeighted 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 informationAdvanced 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
More informationAdvanced Automata Theory 10 Transducers and Rational Relations
Advanced Automata Theory 10 Transducers and Rational Relations Frank Stephan Department of Computer Science Department of Mathematics National University of Singapore fstephan@comp.nus.edu.sg Advanced
More informationCoalgebraic Walks, in Quantum and Turing Computation
Coalgebraic Walks, in Quantum and Turing Computation Bart Jacobs Institute for Computing and Information Sciences icis), Radboud University Nijmegen, The Netherlands. Webaddress: www.cs.ru.nl/b.jacobs
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 informationFinite Automata Theory and Formal Languages TMV027/DIT321 LP4 2018
Finite Automata Theory and Formal Languages TMV27/DIT32 LP4 28 Lecture 5 Ana Bove March 26th 28 Recap: Inductive sets, (terminating) recursive functions, structural induction To define an inductive set
More informationCategorical relativistic quantum theory. Chris Heunen Pau Enrique Moliner Sean Tull
Categorical relativistic quantum theory Chris Heunen Pau Enrique Moliner Sean Tull 1 / 15 Idea Hilbert modules: naive quantum field theory Idempotent subunits: base space in any category Support: where
More informationOn a Categorical Framework for Coalgebraic Modal Logic
On a Categorical Framework for Coalgebraic Modal Logic Liang-Ting Chen 1 Achim Jung 2 1 Institute of Information Science, Academia Sinica 2 School of Computer Science, University of Birmingham MFPS XXX
More informationAn algebraic view of topological -machines
An algebraic view of topological -machines Luke Grecki Graduate Group in Applied Mathematics lgrecki@math.ucdavis.edu June 8, 2010 1 Contents 1 Semigroups 3 2 Semigroups of automata 4 3 -machine words
More informationMonads and Algebras - An Introduction
Monads and Algebras - An Introduction Uday S. Reddy April 27, 1995 1 1 Algebras of monads Consider a simple form of algebra, say, a set with a binary operation. Such an algebra is a pair X, : X X X. Morphisms
More informationQuantum Groups. Jesse Frohlich. September 18, 2018
Quantum Groups Jesse Frohlich September 18, 2018 bstract Quantum groups have a rich theory. Categorically they are wellbehaved under the reversal of arrows, and algebraically they form an interesting generalization
More informationNOTES ON ADJUNCTIONS, MONADS AND LAWVERE THEORIES. 1. Adjunctions
NOTES ON ADJUNCTIONS, MONADS AND LAWVERE THEORIES FILIP BÁR 1. Adjunctions 1.1. Universal constructions and adjunctions. Definition 1.1 (Adjunction). A pair of functors U : C D and F : D C form an adjoint
More informationIntroduction to Finite-State Automata
Introduction to Finite-State Automata John McDonough Language Technologies Institute, Machine Learning for Signal Processing Group, Carnegie Mellon University March 26, 2012 Introduction In this lecture,
More informationComputability and Complexity
Computability and Complexity Sequences and Automata CAS 705 Ryszard Janicki Department of Computing and Software McMaster University Hamilton, Ontario, Canada janicki@mcmaster.ca Ryszard Janicki Computability
More informationLanguage-Processing Problems. Roland Backhouse DIMACS, 8th July, 2003
1 Language-Processing Problems Roland Backhouse DIMACS, 8th July, 2003 Introduction 2 Factors and the factor matrix were introduced by Conway (1971). He used them very effectively in, for example, constructing
More informationDiscrete Random Variables Over Domains
Theoretical Computer Sceince, to appear Discrete Random Variables Over Domains Michael Mislove 1 Department of Mathematics Tulane University New Orleans, LA 70118 Abstract In this paper we initiate the
More informationCellularity, composition, and morphisms of algebraic weak factorization systems
Cellularity, composition, and morphisms of algebraic weak factorization systems Emily Riehl University of Chicago http://www.math.uchicago.edu/~eriehl 19 July, 2011 International Category Theory Conference
More informationPDF hosted at the Radboud Repository of the Radboud University Nijmegen
PDF hosted at the Radboud Repository of the Radboud University Nijmegen The following full text is a preprint version which may differ from the publisher's version. For additional information about this
More informationWhen does a semiring become a residuated lattice?
When does a semiring become a residuated lattice? Ivan Chajda and Helmut Länger arxiv:1809.07646v1 [math.ra] 20 Sep 2018 Abstract It is an easy observation that every residuated lattice is in fact a semiring
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 informationABSTRACT GSOS RULES AND A COMPOSITIONAL TREATMENT OF RECURSIVE DEFINITIONS
ABSTRAT GSOS RULES AND A OMPOSITIONAL TREATMENT OF REURSIVE DEFINITIONS STEFAN MILIUS, LAWRENE S. MOSS, AND DANIEL SHWENKE Institut für Theoretische Informatik, Technische Universität Braunschweig, Germany
More informationRelational Algebra by Way of Adjunctions. Jeremy Gibbons (joint work with Fritz Henglein, Ralf Hinze, Nicolas Wu) DBPL, October 2015
Relational Algebra by Way of Adjunctions Jeremy Gibbons (joint work with Fritz Henglein, Ralf Hinze, Nicolas Wu) DBPL, October 2015 Relational Algebra by Way of Adjunctions 2 1. Summary bulk types (sets,
More informationKleene Algebras and Algebraic Path Problems
Kleene Algebras and Algebraic Path Problems Davis Foote May 8, 015 1 Regular Languages 1.1 Deterministic Finite Automata A deterministic finite automaton (DFA) is a model of computation that can simulate
More informationFinite Automata Theory and Formal Languages TMV027/DIT321 LP4 2017
Finite Automata Theory and Formal Languages TMV027/DIT321 LP4 2017 Lecture 4 Ana Bove March 24th 2017 Structural induction; Concepts of automata theory. Overview of today s lecture: Recap: Formal Proofs
More informationSubdirectly irreducible commutative idempotent semirings
Subdirectly irreducible commutative idempotent semirings Ivan Chajda Helmut Länger Palacký University Olomouc, Olomouc, Czech Republic, email: ivan.chajda@upol.cz Vienna University of Technology, Vienna,
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 informationProgramming Languages in String Diagrams. [ four ] Local stores. Paul-André Melliès. Oregon Summer School in Programming Languages June 2011
Programming Languages in String iagrams [ four ] Local stores Paul-André Melliès Oregon Summer School in Programming Languages June 2011 Finitary monads A monadic account of algebraic theories Algebraic
More informationA Coalgebraic Approach to Linear-Time Logics
A Coalgebraic Approach to Linear-Time Logics Corina Cîrstea University of Southampton cc2@ecs.soton.ac.uk Abstract. We extend recent work on defining linear-time behaviour for state-based systems with
More informationA note on coinduction and weak bisimilarity for while programs
Centrum voor Wiskunde en Informatica A note on coinduction and weak bisimilarity for while programs J.J.M.M. Rutten Software Engineering (SEN) SEN-R9826 October 31, 1998 Report SEN-R9826 ISSN 1386-369X
More informationCompositions of Tree Series Transformations
Compositions of Tree Series Transformations Andreas Maletti a Technische Universität Dresden Fakultät Informatik D 01062 Dresden, Germany maletti@tcs.inf.tu-dresden.de December 03, 2004 1. Motivation 2.
More informationIntroduction to Formal Languages, Automata and Computability p.1/51
Introduction to Formal Languages, Automata and Computability Finite State Automata K. Krithivasan and R. Rama Introduction to Formal Languages, Automata and Computability p.1/51 Introduction As another
More informationOn a Monadic Encoding of Continuous Behaviour
On a Monadic Encoding of Continuous Behaviour Renato Neves joint work with: Luís Barbosa, Manuel Martins, Dirk Hofmann INESC TEC (HASLab) & Universidade do Minho October 1, 2015 1 / 27 The main goal A
More informationNotes about Filters. Samuel Mimram. December 6, 2012
Notes about Filters Samuel Mimram December 6, 2012 1 Filters and ultrafilters Definition 1. A filter F on a poset (L, ) is a subset of L which is upwardclosed and downward-directed (= is a filter-base):
More informationBRIAN OSSERMAN. , let t be a coordinate for the line, and take θ = d. A differential form ω may be written as g(t)dt,
CONNECTIONS, CURVATURE, AND p-curvature BRIAN OSSERMAN 1. Classical theory We begin by describing the classical point of view on connections, their curvature, and p-curvature, in terms of maps of sheaves
More informationVectors: Introduction
Vectors: Introduction Calculus II Josh Engwer TTU 23 April 2014 Josh Engwer (TTU) Vectors: Introduction 23 April 2014 1 / 30 Vectors & Scalars (Definition) Definition A vector v is a quantity that bears
More informationDedicated to Klaus Keimel on the occasion of his 65th birthday
Under consideration for publication in Math. Struct. in Comp. Science Monoids Over Domains MICHAEL MISLOVE Department of Mathematics Tulane University New Orleans, LA 70118 Received 23 January 2004, revised
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 informationWhat is a quantum symmetry?
What is a quantum symmetry? Ulrich Krähmer & Angela Tabiri U Glasgow TU Dresden CLAP 30/11/2016 Uli (U Glasgow) What is a quantum symmetry? CLAP 30/11/2016 1 / 20 Road map Classical maths: symmetries =
More informationDual Adjunctions Between Algebras and Coalgebras
Dual Adjunctions Between Algebras and Coalgebras Hans E. Porst Department of Mathematics University of Bremen, 28359 Bremen, Germany porst@math.uni-bremen.de Abstract It is shown that the dual algebra
More informationLinear Algebra Prof. Dilip P Patil Department of Mathematics Indian Institute of Science, Bangalore
Linear Algebra Prof. Dilip P Patil Department of Mathematics Indian Institute of Science, Bangalore Lecture 01 Introduction to Algebraic Structures - Rings and Fields Welcome to this course on Linear Algebra.
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 informationDuality in Logic and Computation
Duality in Logic and Computation Prakash Panangaden 1 1 School of Computer Science McGill University IEEE Symposium On Logic In Computer Science, June 2013 Panangaden (McGill University) Duality in Logic
More informationQuantizations and classical non-commutative non-associative algebras
Journal of Generalized Lie Theory and Applications Vol. (008), No., 35 44 Quantizations and classical non-commutative non-associative algebras Hilja Lisa HURU and Valentin LYCHAGIN Department of Mathematics,
More informationarxiv: v1 [cs.lo] 25 Feb 2014
On coalgebras with internal moves Tomasz Brengos arxiv:1402.6281v1 [cs.lo] 25 Feb 2014 Faculty of Mathematics and Information Science Warsaw University of Technology Koszykowa 75 00-662 Warszawa, Poland
More informationON HOW TO CONSTRUCT LEFT SEMIMODULES FROM THE RIGHT ONES
italian journal of pure and applied mathematics n. 32 2014 (561 578) 561 ON HOW TO CONSTRUCT LEFT SEMIMODULES FROM THE RIGHT ONES Barbora Batíková Department of Mathematics CULS Kamýcká 129, 165 21 Praha
More informationExtensions in the theory of lax algebras
Extensions in the theory of lax algebras Christoph Schubert Gavin J. Seal July 26, 2010 Abstract Recent investigations of lax algebras in generalization of Barr s relational algebras make an essential
More informationarxiv:math/ v2 [math.qa] 29 Jan 2001
DAMTP-98-117 arxiv:math/9904142v2 [math.qa] 29 Jan 2001 Cross Product Bialgebras Yuri Bespalov Part II Bernhard Drabant July 1998/March 1999 Abstract This is the central article of a series of three papers
More informationGENERATORS FOR COMONOIDS AND UNIVERSAL CONSTRUCTIONS
GENERATORS FOR COMONOIDS AND UNIVERSAL CONSTRUCTIONS Adnan H Abdulwahid University of Iowa Third Conference on Geometric Methods in Representation Theory University of Iowa Department of Mathematics November
More informationEXTENSIONS IN THE THEORY OF LAX ALGEBRAS Dedicated to Walter Tholen on the occasion of his 60th birthday
Theory and Applications of Categories, Vol. 21, No. 7, 2008, pp. 118 151. EXTENSIONS IN THE THEORY OF LAX ALGEBRAS Dedicated to Walter Tholen on the occasion of his 60th birthday CHRISTOPH SCHUBERT AND
More informationAdvances in the theory of fixed points in many-valued logics
Advances in the theory of fixed points in many-valued logics Department of Mathematics and Computer Science. Università degli Studi di Salerno www.logica.dmi.unisa.it/lucaspada 8 th International Tbilisi
More informationA Differential Model Theory for Resource Lambda Calculi - Part I
A Differential Model Theory for Resource Lambda Calculi - Part I Giulio Manzonetto g.manzonetto@cs.ru.nl Intelligent Systems Radboud University Nijmegen FMCS 2011 - Calgary - 11 th June 2011 Giulio Manzonetto
More informationTakeuchi s Free Hopf Algebra Construction Revisited
Takeuchi s Free Hopf Algebra Construction Revisited Hans E. Porst Department of Mathematics, University of Bremen, 28359 Bremen, Germany Abstract Takeuchi s famous free Hopf algebra construction is analyzed
More informationBialgebraic Methods in Structural Operational Semantics
SOS 2006 Preliminary Version Bialgebraic Methods in Structural Operational Semantics (Invited Talk) Bartek 1,2 Warsaw University, Edinburgh University Abstract Bialgebraic semantics, invented a decade
More informationSemilattice Modes II: the amalgamation property
Semilattice Modes II: the amalgamation property Keith A. Kearnes Abstract Let V be a variety of semilattice modes with associated semiring R. We prove that if R is a bounded distributive lattice, then
More informationSimulations in Coalgebra
Simulations in Coalgebra Jesse Hughes Dept. Philosophy, Technical Univ. Eindhoven, P.O. Box 513, 5600 MB Eindhoven, The Netherlands. J.Hughes@tm.tue.nl Bart Jacobs Dept. Computer Science, Univ. Nijmegen,
More informationCS 455/555: Finite automata
CS 455/555: Finite automata Stefan D. Bruda Winter 2019 AUTOMATA (FINITE OR NOT) Generally any automaton Has a finite-state control Scans the input one symbol at a time Takes an action based on the currently
More informationBisimulation for Neighbourhood Structures
Bisimulation for Neighbourhood Structures Helle Hvid Hansen 1,2 Clemens Kupke 2 Eric Pacuit 3 1 Vrije Universiteit Amsterdam (VUA) 2 Centrum voor Wiskunde en Informatica (CWI) 3 Universiteit van Amsterdam
More informationA quantum double construction in Rel
Under consideration for publication in Math. Struct. in Comp. Science A quantum double construction in Rel M A S A H I T O H A S E G A W A Research Institute for Mathematical Sciences, Kyoto University,
More informationStrong Deterministic Fuzzy Automata
Volume-5, Issue-6, December-2015 International Journal of Engineering and Management Research Page Number: 77-81 Strong Deterministic Fuzzy Automata A.Jeyanthi 1, B.Stalin 2 1 Faculty, Department of Mathematics,
More informationINFORMATIQUE THÉORIQUE ET APPLICATIONS
INFORMATIQUE THÉORIQUE ET APPLICATIONS J. J. M. M. RUTTEN A note on coinduction and weak bisimilarity for while programs Informatique théorique et applications, tome 33, n o 4-5 (1999), p. 393-400
More informationWhat are Iteration Theories?
What are Iteration Theories? Jiří Adámek 1, Stefan Milius 1 and Jiří Velebil 2 1 Institute of Theoretical Computer Science, TU Braunschweig, Germany {adamek,milius}@iti.cs.tu-bs.de 2 Department of Mathematics,
More informationKleene Algebra and Arden s Theorem. Anshul Kumar Inzemamul Haque
Kleene Algebra and Arden s Theorem Anshul Kumar Inzemamul Haque Motivation Regular Expression is a Kleene Algebra. We can use the properties and theorems of Kleene Algebra to simplify regular expressions
More informationAlgebraic theories in the presence of binding operators, substitution, etc.
Algebraic theories in the presence of binding operators, substitution, etc. Chung Kil Hur Joint work with Marcelo Fiore Computer Laboratory University of Cambridge 20th March 2006 Overview First order
More informationNoncommutative motives and their applications
MSRI 2013 The classical theory of pure motives (Grothendieck) V k category of smooth projective varieties over a field k; morphisms of varieties (Pure) Motives over k: linearization and idempotent completion
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 informationMathematics Department Stanford University Math 61CM/DM Vector spaces and linear maps
Mathematics Department Stanford University Math 61CM/DM Vector spaces and linear maps We start with the definition of a vector space; you can find this in Section A.8 of the text (over R, but it works
More informationThus we get. ρj. Nρj i = δ D(i),j.
1.51. The distinguished invertible object. Let C be a finite tensor category with classes of simple objects labeled by a set I. Since duals to projective objects are projective, we can define a map D :
More informationarxiv: v1 [cs.lo] 28 Nov 2017
A UNIFORM FRAMEWORK FOR TIMED AUTOMATA AND BEYOND TOMASZ BRENGOS AND MARCO PERESSOTTI arxiv:1711.10233v1 [cs.lo] 28 Nov 2017 Faculty of Mathematics and Information Science, Warsaw University of Technology,
More informationAn Algebraic Approach to Energy Problems I -Continuous Kleene ω-algebras
Acta Cybernetica 23 (2017) 203 228. An Algebraic Approach to Energy Problems I -Continuous Kleene ω-algebras Zoltán Ésika, Uli Fahrenberg b, Axel Legay c, and Karin Quaas d Abstract Energy problems are
More informationAn Introduction to the Theory of Coalgebras
An Introduction to the Theory of Coalgebras Dirk Pattinson Institut für Informatik, LMU München 2 Contents 1 Introduction 7 1.1 State Based Systems....................... 7 1.1.1 Informal Denition....................
More informationAlgebraic model structures
Algebraic model structures Emily Riehl University of Chicago http://www.math.uchicago.edu/~eriehl 22 June, 2010 International Category Theory Conference Università di Genova Emily Riehl (University of
More informationSYNTACTIC SEMIGROUP PROBLEM FOR THE SEMIGROUP REDUCTS OF AFFINE NEAR-SEMIRINGS OVER BRANDT SEMIGROUPS
SYNTACTIC SEMIGROUP PROBLEM FOR THE SEMIGROUP REDUCTS OF AFFINE NEAR-SEMIRINGS OVER BRANDT SEMIGROUPS JITENDER KUMAR AND K. V. KRISHNA Abstract. The syntactic semigroup problem is to decide whether a given
More informationMix Unitary Categories
1/31 Mix Unitary Categories Robin Cockett, Cole Comfort, and Priyaa Srinivasan CT2018, Ponta Delgada, Azores Dagger compact closed categories Dagger compact closed categories ( -KCC) provide a categorical
More informationSemantics and syntax of higher inductive types
Semantics and syntax of higher inductive types Michael Shulman 1 Peter LeFanu Lumsdaine 2 1 University of San Diego 2 Stockholm University http://www.sandiego.edu/~shulman/papers/stthits.pdf March 20,
More informationFormal Models in NLP
Formal Models in NLP Finite-State Automata Nina Seemann Universität Stuttgart Institut für Maschinelle Sprachverarbeitung Pfaffenwaldring 5b 70569 Stuttgart May 15, 2012 Nina Seemann (IMS) Formal Models
More information(Co)Algebraic Characterizations of Signal Flow Graphs
(Co)Algebraic Characterizations of Signal Flow Graphs Henning Basold 1,3, Marcello Bonsangue 2,3, Helle H. Hansen 1,3, Jan Rutten 3,1 1 Radboud University Nijmegen 2 Leiden University 3 CWI Amsterdam Abstract
More informationOperational Theories and Categorical Quantum Mechanics
Operational Theories and Categorical Quantum Mechanics Samson Abramsky and Chris Heunen Department of Computer Science University of Oxford June 7, 2013 Abstract A central theme in current work in quantum
More informationAutomata, Logic and Games: Theory and Application
Automata, Logic and Games: Theory and Application 2 Parity Games, Tree Automata, and S2S Luke Ong University of Oxford TACL Summer School University of Salerno, 14-19 June 2015 Luke Ong S2S 14-19 June
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 informationTowards Mac Lane s Comparison Theorem for the (co)kleisli Construction in Coq
Towards Mac Lane s Comparison Theorem for the (co)kleisli Construction in Coq Burak Ekici University of Innsbruck Innsbruck, Austria burak.ekici@uibk.ac.at Abstract This short paper summarizes an ongoing
More information