Thumbnail Image
Publication

CS 350-01, Theory of Computation, Spring 2010

Sheard, Michael
Citations
Altmetric:
Contributor
Photographer
Author
Sheard, Michael
Artist
Editor
Advisor
Keywords
Mathematics and Computer Science, Department of, 2010 Spring, Curriculum, Syllabus, Academic departments
Local ID
Collections
Course Syllabi
Show all metadata
Files
Thumbnail Image
2010_SPRING_CS_350-01_20276.pdf
Adobe PDF, 8.75 KB
URI
http://hdl.handle.net/10267/15738
Abstract
Automata 1. The following are equivalent for a language L: (a) There is a (deterministic) finite automaton (DFA) which recognizes L (i.e., L is regular). (b) There is a non-deterministic finite automaton (NFA) which recognizes L. (c) L is described by a regular expression.
Description
This syllabus was submitted to the Rhodes College Office of Academic Affairs by the course instructor. Uploaded by Archives RSA Josephine Hill.