Courses
Catalog description--Turing
machines; mu-recursive functions; equivalence of computing paradigms;
Church-Turing thesis; undecidability. Four credit hours. Prerequisite: CS
466/666.
·
Syllabus
·
Old examinations:
solutions to previous exams. These are
in the online reserve at the WSU library.
·
Solutions manual:
solutions to about 1/3 of the homework problems in the text. This is also in the online reserve at the WSU
library.
Instructions for accessing the
online reserve:
a) go to
http://www.libraries.wright.edu/
b) click on Course Reserves
c) click on Electronic
Reserves and Reserve Pages
d) select Course and enter CS 466
e) when prompted, enter password
f) select desired topics
Catalog
description--Introduction to the theory of formal languages and automata.
Emphasis is on those classes of languages commonly encountered by computer
scientists, such as regular and context-free languages. Four credit hours. Prerequisite: CS 600, MTH
257; or MTH 257 and completion of a 600-level math or statistics course.
·
Syllabus
·
Old examinations:
solutions to previous exams. These are
in the online reserve at the WSU library (see above for access).
·
Solutions manual:
solutions to about 1/3 of the homework problems in the text. This is in the online reserve at the WSU
library (see above for access).
Catalog description--Time
complexity analysis of algorithms; computational complexity; NP completeness.
Four credit hours. Prerequisite: CS 610, 666.
·
Syllabus
Catalog description--Provides
an introduction to fuzzy set theory that serves as a basis for the study of
fuzzy rule-based systems, pattern classification, function approximation,
modeling, and information processing.
Four credit hours. Prerequisite: CS 600
·
Syllabus
Catalog
description--Continuation of CS 610, 666, and 740. Covers advanced topics taken
from formal language theory, predicate calculus, algorithm analysis, or
complexity theory. Four credit hours. Prerequisite: CS 740 or consent of
instructor.
·
Syllabus