Formal Languages and Computability
(csc360)
Fall 2020
Dr. Gur Saran Adhar
Catalogue Description
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 (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 discusses 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:
Sec-001
Tu., Th: 9:30-10:45
Sec-002 Tu., Th: 12:30-1:45
Important Dates:
Drop/add
closes: August 26, 2020
Last
date to withdraw with W: October 16, 2020
Old Final Exam Fall-2013
Old Final Exam Spring-2010
|
