Automata theory Hard decision problems Regular Cost Functions

First Page		Document Content
Date: 2014-10-15 08:27:58 Mathematics Semigroup theory Algebra Category theory Models of computation Regular language Monoid Finite-state machine Free monoid Formal languages Abstract algebra Automata theory		Automata theory Hard decision problems Regular Cost Functions Add to Reading List Source URL: www.liafa.univ-paris-diderot.fr Download Document from Source Website File Size: 723,13 KB Share Document on Facebook

	Category Theory for Program Construction by Calculation Lambert Meertens CWI, Amsterdam and Department of Computing Science, Utrecht University DocID: 1xVdS - View Document
	Noah Snyder: Research Statement Quantum Algebra and Quantum Topology I work in an area at the intersection of representation theory, low-dimensional topology, higher category theory, and operator algebras which is often DocID: 1uTPa - View Document
	Category Theory 1 Categories and functors This is to accompany the reading of 1–7 October and the lecture of 8 October. Please report mistakes and obscurities to . Some questions on these shee DocID: 1uaiD - View Document
	Category Theory in Context Emily Riehl Chapter 6 is adapted with permission from Chapter 1 of Categorical Homotopy Theory, by Emily Riehl, Cambridge University Press. © Emily Riehl 2014 DocID: 1tYcG - View Document
	CAT axioms CAT001-0.ax Category theory axioms defined(x, y) ⇒ x · y=x ◦ y cnf(closure of composition, axiom) x · y=z ⇒ defined(x, y) cnf(associative property1 , axiom) DocID: 1tTwQ - View Document