<--- Back to Details
First PageDocument Content
Finite automata / Regular language / Nondeterministic finite automaton
Date: 2016-02-03 00:10:01
Finite 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 graduate

Add to Reading List

Source URL: homepages.math.uic.edu

Download Document from Source Website

File Size: 182,44 KB

Share Document on Facebook

Similar Documents