|
Title:
|
|
Theory of Computing
|
|
|
|
Instructor:
|
|
Cezar Câmpeanu
|
|
|
|
Email:
|
|
ccampeanu < at > upei < dot > ca
|
|
|
|
Office:
|
|
CASS 408
|
|
|
|
Tel:
|
|
(902)566-0485
|
|
|
|
Textbook:
|
|
TBA
|
|
|
|
:
|
|
TBA
|
|
|
|
Recommended reading:
|
|
Handbook of Formal Languages Vols. 1 - 3 Rozenberg, Grzegorz; Salomaa, Arto (Eds.) 1997, LXVIII, 2051 p. 272 illus., Hardcover ISBN: 3-540-61486-9
|
|
|
|
General description:
|
|
This course introduces automata theory, formal languages and computability. Topics include: finite automata, regular expressions, context-free and context-sensitive languages, Turing machines, recursive functions, recursive and recursively-enumerable sets, and unsolvable and intractable problems.
|
|
|
|
PREREQUISITE:
|
|
CS 261/CS2920 and Math 2420
|
|
|
|
Essential to review:
|
|
Set theory, Mathematical Logic, including boolean algebras, Induction, Arithmetic/Number Theory (mainly Modular Arithmetic).
|
|
|
|
Time and Location:
|
|
TBA
|
|
|
|
Office Hours:
|
|
TBA
|
|
|
|
:
|
|
TBA
|
|
|
|
To make sure you are viewing the most recent version of this page,press the shift key while clicking on the Reload button.
It is your responsibility to check this page for updates.