home > academics > graduate > courses Theory Of Computation Narahari and Staff Credits: 3 Theoretical foundations of computer science. Formal languages and automata; Regular languages, context-free languages, parsing; Turing machines and computability; Partial Recursive functions; Undecidability; Program Correctness; Fixed-point theory; Formal specification of software. Prerequisite: CSci 210, 212 (Spring).
		home | general information | contact/directions | research | academics | people student corner | news & events | site map | prospective students | prospective faculty
		© 2003, The George Washington University Department of Computer Science Last Updated: August 23, 2002

Text: Logic and Language Models for Computer Science, 1/e , Henry Hamburger and Dana Richards, Prentice Hall.

Course Outline

• Mathematical Foundations
• Formal specification of programs and languages
• Introduction to fixed point theory
• Formal models of Automata and applications (parsing, Protocol design)
• Formal grammars
• Models of computation and theory of decidability
• Mathematical logic and logic programming