Varieties Generated by Certain Models of Reversible Finite Automata

First Page		Document Content
Date: 2011-06-02 15:22:32 Mathematics Semigroup theory Algebra Models of computation Category theory Semiautomaton Monoid Free monoid Regular language Abstract algebra Automata theory Formal languages		Varieties Generated by Certain Models of Reversible Finite Automata Add to Reading List Source URL: cjtcs.cs.uchicago.edu Download Document from Source Website File Size: 476,92 KB Share Document on Facebook

	The Most General Conservation Law for a Cellular Automaton Enrico Formenti1? , Jarkko Kari2?? , and Siamak Taati32 1 Universit´e de Nice-Sophia Antipolis, D´epartment d’Informatique, DocID: 1rqpP - View Document
	Product systems over Ore monoids DocID: 1rcVf - View Document
	Product systems over Ore monoids DocID: 1q9Gf - View Document
	Maximal subgroups of free idempotent generated semigroups York Semigroup 28th January 2015 DocID: 1q7xI - View Document
	Categories and their Algebra James A. Overton September 13, 2005 Abstract The goal if this paper is to introduce the notion of a category, along with some basic results, and then to explore work done by Bret Tilson in hi DocID: 1pmw8 - View Document