Formal Languages and Computability
Dr. Gur Saran Adhar
An introduction to theoretical computer science. Topics include regular
expression and finite state concepts; basic automata theory; formal grammar
and languages; computability; Turing machines; elementary recursive function
Purpose of the course
This course provides necessary background for constructing compilers (Lexical
Analyzer and Parser) for Computer Languages. Topics are logically divided
into three parts. Part I: Chapters 1 and 2 provide the Mathematical
Preliminaries (Ch. 1) and a formal mechanism for language specification (Ch.
2); Part II: Chapters 3 thru 5 discuss Context-Free
Grammar, Normal Forms, Finite Automata, and Pushdown Automata; and Part V:
Chapters 18-20 discuss Parsing.
At the end of this course you will have understanding of the nature of
different computation models viz., Finite Automata (Ch. 5), Pushdown Automata
(Ch. 7) and their relationship/limitations with respect to recognition of
different classes of languages viz., Context Free Languages (Ch. 3), Regular
Languages (Ch. 6).
Meeting Days, Time, Place:
Tu. Thurs. 12:30-1:45pm
Drop/add closes: August 27
date to withdraw with W: October
Stroud, Billy James, M, T, W 9:00-noon Graduate Lab