First Page | Document Content | |
---|---|---|
Date: 2011-06-02 15:22:32Mathematics 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 AutomataAdd to Reading ListSource URL: cjtcs.cs.uchicago.eduDownload Document from Source WebsiteFile Size: 476,92 KBShare Document on Facebook |
Microsoft PowerPoint - Presentationshaheen1.pptxDocID: 1rn3C - View Document | |
MODEL-THEORETIC PROPERTIES OF FREE, PROJECTIVE AND FLAT S-ACTS VICTORIA GOULD, ALEXANDER MIKHALEV, EVGENY PALYUTIN, AND ALENA STEPANOVA Abstract. This is the second in a series of articles surveying the body of work on tDocID: 1kbBw - View Document | |
Varieties Generated by Certain Models of Reversible Finite Automata Marats Golovkins∗ Faculty of Computing, University of Latvia, Rai¸na bulv. 29, Riga LV-1459, Latvia marats at latnet dot lvDocID: 140xJ - View Document | |
Varieties Generated by Certain Models of Reversible Finite AutomataDocID: 13Pbi - View Document | |
M1 Summer internship report Computer Science Department, Boston College June – August 2010 Advisor: Howard StraubingDocID: 11TtK - View Document |