First Page | Document Content | |
---|---|---|
Date: 2016-02-03 00:10:01Finite automata Regular language Nondeterministic finite automaton | MCS 441 – Theory of Computation I Spring 2016 Problem Set 1 Lev Reyzin Due: at the beginning of class Instructions: Atop your problem set, please write your name and whether you are an undergraduate or graduateAdd to Reading ListSource URL: homepages.math.uic.eduDownload Document from Source WebsiteFile Size: 182,44 KBShare Document on Facebook |