CSE322Formal Languages and Automation TheoryLecture #0
Course details•LTP – 3 0 0 [Three lectures/week]•Text Book•Theory of Computer Science: Automata, Languages and Computation•Author: KLP Mishra and N. Chandrasekaran
Course Assessment Model•Marks break up•Attendance5•CA(Best 2out of 3)20•MTE25•ETE50•Total1001.>=90%-- 5 marks2.>=85% and <90%-- 4 marks3.>=80% and <85%-- 3 marks4.>=75% and <80%-- 2 marksEach CA would be of 30 marks. Best 2 would be taken at the end (60 marks) which would be prorated out of 20MTE would be of 40 marks and it would be prorated to 25 at the endETE would be of 70 marks and it would be prorated to 50 at the end
Detail of Academic TasksCSE322•AT1:Test1Lecture #11(Before MTE)•AT2:Test2Lecture #19(Before MTE)•AT3:Test3Lecture #33(After MTE)
The course contents•UNIT 1 - Finite automata•UNIT 2 - Regular expressions and regular sets•UNIT 3 - Formal languages and regular grammars•UNIT 4 - Context- free languages and simplification of context-free grammar•UNIT 5 - Pushdown automata and parsing•UNIT 6 - Turing machines and complexity
Main PerspectiveThe three main perspective are:•Why are we learning Automata Theory?•What would we do with it?•What will be the course outcome?
Why Study Automata Theory?
•Automata theory tells very important equivalence between•a language: some -- usually -- infinite set of
Why Study Automata Theory?Automata theory is the study of abstract computational devicesAbstract devices are (simplified) models of real computationsComputations happen everywhere: On your laptop, on your cell phone, in nature, …Why do we need abstract models?