Languages and Computability (csc360)
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 theory.
Purpose of the course
This course provides necessary
background for constructing compilers (Lexcial 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 and Parsing; and Part III: Chapters 6
thru 8 discuss Automata and Languages.
At the end of this course you will have understanding of the nature of
different computation models viz., Finite Automata (Ch. 6), Pushdown
Automata (Ch. 8) and their relationship/limitations with respect to
recognition of different classes of languages viz., Context Free Languages
(Ch. 3), Regular Languages (Ch. 7).
Meeting Days, Time, Place:
Mon., Wed., Fri., 9:00-9:50 am, BR206
date to withdraw with W: Feb.25