Please use this identifier to cite or link to this item:
Title: CS 350-01, Theory of Computation, Spring 2010
Authors: Sheard, Michael
Keywords: Mathematics and Computer Science, Department of;2010 Spring;Curriculum;Syllabus;Academic departments
Issue Date: 30-Jan-2009
Publisher: Memphis, Tenn. : Rhodes College
Series/Report no.: Syllabi CRN;20276
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.
Appears in Collections:Course Syllabi

Files in This Item:
File Description SizeFormat 
2010_SPRING_CS_350-01_20276.pdf8.75 kBAdobe PDFThumbnail

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.