Automata

Lovely Professional University, Punjab

Course Code Course Title Course Planner Lectures Tutorials Practicals Credits

CAP632 FORMAL LANGUAGES AND AUTOMATION THEORY

15668::Rachit Garg 3.0 0.0 0.0 3.0

Course Category Courses with conceptual focus

TextBooks

Sr No Title Author Edition Year Publisher Name

T-1 Theory of Computer Science :Automata, languages & Computation

K.L.P Mishra & N. Chandrasekran

1st PHI (Pretice Hall India)

Reference Books

Sr No Title Author Edition Year Publisher Name

R-1 Introduction to languages & the Theory of Computation

John C Martin 1st Tata McGraw Hill

R-2 Theory of Computation Kavi Mahesh 1st Wiley India Pvt Ltd

R-3 An Introduction To Formal Languages And Automata

Peter Linz 4th 2010 Narosa Publishing House Pvt. Ltd

Other Reading

Sr No Journals articles as Compulsary reading (specific articles, complete reference)

OR-1 http://cs.fit.edu/~dmitra/FormaLang/ ,

OR-2 http://www.mywbut.com/syllabus.php?mode=VT&paper_id=14&dept_id=2 ,

OR-3 http://www.gobookee.net/formal-languages-and-automata-theory-by-krithivasan/ ,

Audio Visual Aids

Sr No (AV aids) (only if relevant to the course) Salient Features

AV-1 http://www.ida.liu.se/~TDDA89/ To provide students in learning basic and advanced concepts through remote experimentation

AV-2 http://www.cse.cuhk.edu.hk/~andrejb/csc3130/f08/ To provide various tools for learning, including web recources, video lectures, animated demonstration and seld evaluation

AV-3 http://www.nptel.iitm.ac.in/courses/106106049/ To provide various tools for learning, including web recources, video lectures, animated demonstration and seld evaluation

LTP week distribution: (LTP Weeks)

Weeks before MTE 7

Weeks After MTE 7

Week Number

Lecture Number

Broad Topic(Sub Topic) Chapters/Sections of Text/reference books

Other Readings,Relevant Websites, Audio Visual Aids, software and Virtual Labs

Lecture Description Learning Outcomes Pedagogical ToolDemonstration/ Case Study / Images / animation / ppt etc. Planned

Week 1 Lecture 1 Automata(Definition) T-1:Ch-1 OR-2 Introduction and motivation of Auotmata

Students will learn about the need and use of TOC in the field of Computer Science

Peer Learning, Case Study Discussion and Demonstration of Animation

Lecture 2 Automata(Description and transition modes)

T-1:Ch-3 AV-1AV-2

Complexity theory Computability theory Automata theory

Students will learn about the transition modes


Lecture 3 Automata(NDFA and DFA) T-1:Ch-3 AV-3DK-2

NDFA is a variation of the FSM that will make it much easier to design FSMs

Makes it easy to design FSMs


Week 2 Lecture 4 Automata(Mealy and Moore machine)

T-1:Ch-3 OR-2OR-3

Variants of Finite automata

Students learn about Finite automata with output


Automata(Minimization of Finite Automata)

T-1:Ch-3 OR-1AV-1

Deterministic finite automata and example of a finite automata

Students learn to reduce a Complex Finite Automata


Automata(Constructing simple automata)

T-1:Ch-4 OR-3AV-1

Formal definition of a finite automaton

Students learn to Designfinite automata


Lecture 5 Automata(Handling end conditions)

T-1:Ch-4 OR-2OR-3

Regular operations of simple automata

Students learn the importance of Finite Automataconditions


Automata(Handling reject states) T-1:Ch-4 AV-1 Proof techniques of automata states

Students learn the importance of Finite Automatastates


Automata(Step by step method for constructing automata)

T-1:Ch-4 OR-3 To construct and analyse automata behaviour

Learn the importance of construction of Automata


Detailed Plan For Lectures

Spill Over 3

Week 2 Lecture 5 Automata(States as Memory) T-1:Ch-5 AV-2AV-3

To construct states to compute functions

Learn the importance of corresponding states


Automata(Why finite number of states)

T-1:Ch-5 AV-2AV-3

Process and accept infinite sets if input strings

Students learn the importance of Automata states


Automata(Limitations of finite automata)

T-1:Ch-5 OR-3AV-1

Constructing automata to solve computing problems

Learn the Limitations of finite automata


Lecture 6 Automata(Non deterministic finite automata)

T-1:Ch-5 OR-2 Formal definition of a non deterministic finite automata

Learn the importance of NDFA Closure under the regular operations


Construction of Finite Automata(Construction of Finite Automata equivalent to Regular expression & vice versa)

T-1:Ch-5 OR-2OR-3

Relation between Finite Automata Regular Expressions

Any FSM can be converted to a regular expression, and every regular expression can be converted into a nondeterministic FSM


Construction of Finite Automata(Pumping Lemma for regular sets & its applications)

T-1:Ch-5 AV-2AV-3

Non regular Languages The pumping lemma for regular languages

The pumping lemma for Regular sets is a way to convince students that certain sets are not Regular


Week 3 Lecture 7 Pushdown Automata(Definition) T-1:Ch-7 OR-3 Describing the basics of Push Down Automata

A push down automaton PDA or is a type of automaton that uses a stack for temporary data storage


Pushdown Automata(Acceptance) T-1:Ch-7 AV-3DK-1

Types of acceptance by Pushdown Automata

Students learn about the technique for acceptance of string


Pushdown Automata(Pushdown Automata and Context Free Languages)

T-1:Ch-7 OR-2 Relationship between Push down Automata and Context Free Languages

Learn about Connection between Push down Automata and Context Free Languages


Lecture 8 Pushdown Automata(Parsing and Pushdown automata)

T-1:Ch-7 OR-2AV-3

Purpose of Parsing in automata

Learn about Top Down and Bottom Up Parsing


Pushdown Automata(Constructing PDAs)

T-1:Ch-7 OR-3AV-1

To teach about the construction of PDA

Students solve the examples of push down automata


Week 3 Lecture 9 Pushdown Automata(Converting CFGs to PDAs)

T-1:Ch-7 AV-2DK-1

Designing PDAs from context free grammars

Ways to simplify CFGs Peer Learning, Case Study Discussion and Demonstration of Animation

Pushdown Automata(Converting PDAs to CFGs)

T-1:Ch-7 OR-2 Designing PDAs to CFGs

Ways to simplify PDAs Peer Learning, Case Study Discussion and Demonstration of Animation

Context Free languages(Derivation trees)

T-1:Ch-6 OR-2 Other way of representing a CFG

Parse tree as a way to represent the derivation of a string from a grammar


Week 4 Lecture 10 Context Free languages(Ambiguity in Context free grammars)

T-1:Ch-6 OR-1AV-3DK-3

To ambiguity in context free grammars

Students learn the importance of Ambiguity with the help of examples


Context Free languages(Simplification of context free grammars)

T-1:Ch-6 AV-1AV-3

Equivalence with context free grammars

Students learn the ways to equivalent context free grammars


Lecture 11 Context Free languages(The Chomsky & Greibach Normal Forms)

R-2:ch-6 AV-3 Describing CNF Students learn to reduce grammar to a CNF


Context Free Grammars(The Kuroda Normal Form)

R-3:Ch-6 OR-3 DescribingKuroda Normal Form

Students learn the importance of KNF


Lecture 12 Context Free Grammars(One sided Context Sensitive Grammars)

R-3:Ch-6 OR-1OR-3

Elaborates concept of KNF

Learns about the implementation of KNF


Context Free Grammars(Unrestricted Languages)

R-3:Ch-6 AV-1DK-2DK-3

Implementation for making restrictions

Learn the usage of restrictions


Regular Languages and Expressions(Idea of formal languages)

R-3:Ch-6 AV-1DK-2

Introduction to formal language

Learn the concept of formal language


Week 5 Lecture 13 Regular Languages and Expressions(Languages of Automata)

R-3:Ch-6 DK-1 Highlights on Automata Understands the concept of automaton


Regular Languages and Expressions(Regular expressions)

R-3:Ch-6 OR-2AV-1

Recursive definition Learn to construct simple regular expression


Week 5 Lecture 13 Regular Languages and Expressions(Converting Regular expressions to automata)

R-3:Ch-6 OR-2AV-1

Mapping from elements of regular expression to NFA

Learn to convert regular expression to equivalent automata


Lecture 14 Turing Machines(Representation) T-1:ch-9 DK-2DK-3

Ways to design Turing Machines

Understands about Formal definition of a Turing machine


Turing Machines(Language acceptability)

T-1:ch-9 OR-3 Examples of Turing machines and computable functions

Learn to construct turing machines


Turing Machines(Design & description of Turing machines)

T-1:ch-9 OR-3 Constructing complex turing machines

Learn techniques for constructing turing machines


Lecture 15 Term Paper,Test 1

Week 6 Lecture 16 Turing Machines(Variants of Turing machines)

T-1:ch-9 OR-1AV-1DK-1

Machines with stay option,multi track machines,Semi infinite tape machines

Understand design variation for turing machines


Turing Machines(Turing Machines Construction)

T-1:ch-9 OR-1AV-2

Techniques used for constructing turing machines

Understands the methods used for designing turing machines


Turing Machines(The Church Turing thesis)

T-1:ch-9 OR-2AV-3

Alogrithm for Church Turing thesis

Learns about the concept of church turing


Lecture 17 Turing Machines(Universal Turing Machine)

T-1:ch-9 AV-2 Stored program computer

Understands working of UTM


Lecture 18 Syntax Analysis(Ambiguity and the formal power Series)

T-1:ch-9 OR-2AV-1

Eliminating ambiguity Understands the procedure to remove ambiguity


Week 7 Lecture 19 Syntax Analysis(Formal Properties of LL(k) and LR(k) Grammars)

T-1:ch-9 OR-3AV-1

L19 Parsing strategies

L20 is revisionL21 is revision

Learns about the features of LL and LR


Lecture 20 Syntax Analysis(Formal Properties of LL(k) and LR(k) Grammars)

T-1:ch-9 OR-3AV-1





Lecture 21 Syntax Analysis(Formal Properties of LL(k) and LR(k) Grammars)

T-1:ch-9 OR-3AV-1





MID-TERMWeek 8 Lecture 22 Formal Languages(Chomsky

classification of languages)R-2:ch-7 OR-3

DK-2 Definition of grammar Learn the difference

between different types of ets


Lecture 23 Formal Languages(Languages and their relation)

R-2:ch-7 AV-2DK-3

Formal Language and their relation

Understand about the relation of formal languages


Lecture 24 Formal Languages(Linear Grammars and regular Languages)

R-2:ch-7 OR-2AV-1

Linear grammar Understand the concept of Linear grammar


Week 9 Lecture 25 Formal Languages(Regular Expressions)

R-2:ch-5 AV-3DK-2

Definition of regular expression

Learn to construct simple regular expression


Lecture 26 Formal Languages(Context Sensitive Languages)

R-2:ch-5 OR-2AV-2AV-3

Context sensitive Language

Learn about the concept of CSL


Lecture 27 Grammars(Parsing and Derivation) R-2:ch-5 AV-3 Introduction to parsing Parse tree as a way to represent the derivation of a string from a grammar


Week 10 Lecture 28 Grammars(Closure properties) R-2:ch-5 AV-3 Union,concatenation,compliment , reversal

Learn to use closure properties to obtain more complex regular language


Lecture 29 Grammars(Pigeonhole principal and pumping lemma)

R-2:ch-6 AV-3 Adversarial Game Learn to handle regular languages with repeating patterns


Lecture 30 Grammars(Constructing Regular grammars)

R-2:ch-6 OR-3AV-3

Introduction to regular grammars

Learn to construct regular expression for user dat avalidation


Week 11 Lecture 31 Decidability(Decidable languages) T-1:Ch-10 OR-3AV-3

Decidable problems concerning regular languages

Understands kinds of problems that are undecidable


Lecture 32 Decidability(Unpredictable languages)

T-1:Ch-10 OR-3AV-3

Decidability and Unpredictable languages

Understand the concept of Unpredictable languages


Week 11 Lecture 33 Decidability(Halting problems of Turing machines)

T-1:Ch-10 AV-3 Problems in halting Turing machines

Understanding the halting problem of turing machines


Week 12 Lecture 34 Computability(Partial recursive functions)

T-1:Ch-11 OR-1AV-3

Computability and turing model for computation

Understands various functions performed by partial recursive


Lecture 35 Computability(Basic concepts) T-1:Ch-11 AV-3 Steps of Computability Understands about concepts of computability


Computability(Recursive functions)

T-1:Ch-11 AV-3 Computability Recursive functions

Understands computability recursive functions


Computability(Partial Recursion) T-1:Ch-11 OR-3AV-3

Partial functions Understands concept of partial recursive functions


Lecture 36 Term Paper,Test 2

Week 13 Lecture 37 Computers and the science of computing(Idea of computing)

R-2:ch-12 AV-3DK-3

Concept of computing Learn the importance of Computing machines


Computers and the science of computing(Computing machines and languages)

R-2:ch-12 AV-3 Introduction of computing machines

Understands the working of computing machines


Computers and the science of computing(Programming and Data structures)

T-1:Ch-11 AV-1 Data structures used in programming

Understands the need of data structures


Lecture 38 The Chomsky Hierarchy(Enumerable Languages)

R-2:ch-11 AV-3 Parsing with CNF Learns about the techniques for parsing


The Chomsky Hierarchy(Diagonalization)

R-2:ch-11 AV-3 Chomsky Hierarchy problems

Understand the concept of Chomsky Hierarchy


Lecture 39 The Chomsky Hierarchy(Acceptance and membership)

R-2:ch-11 AV-3 Chomsky Acceptance Understands concept of acceptance and membership


Week 14 Lecture 40 The Chomsky Hierarchy(Recursive languages)

R-2:ch-11 AV-3 L40Recursive languages in The Chomsky Hierarchy L41 is revisionL42 is revision

Understand the need of recursive languages


Lecture 41 The Chomsky Hierarchy(Recursive languages)




Lecture 42 The Chomsky Hierarchy(Recursive languages)




SPILL OVERWeek 15 Lecture 43 Spill Over

Lecture 44 Spill Over

Lecture 45 Spill Over

Scheme for CA:Component Frequency Out Of Each Marks Total Marks

Term Paper,Test 2 3 10 20

Total :- 10 20

Details of Academic Task(s)

AT No. Objective Topic of the Academic Task Nature of Academic Task(group/individuals/field

work

Evaluation Mode Allottment / submission Week

Term Paper,Test 1 To define the power of any computation model that would be determined by analysing formal languages

Unit IAutomata : Definition, Description and transition modes, NDFA and DFA, Mealy andMoore machine, Minimization of Finite Automata, Constructing simple automata,Handling end conditions, Handling reject states, Step by step method for constructingautomata, States as Memory, Why finite number of states, Limitations of finiteautomata, Non deterministic finite automataConstruction of Finite Automata : Construction of Finite Automata equivalent toRegular expression & vice versa, Pumping Lemma for regular sets & its applicationsPushdown Automata : Definition, Acceptance, Pushdown Automata and ContextFree Languages, Parsing and Pushdown automata, Constructing PDAs, ConvertingCFGs to PDAs, Converting PDAs to CFGsUnit IIContext Free languages : Derivation trees, Ambiguity in Context free grammars,Simplification of context free grammars, The Chomsky & Greibach Normal FormsContext Free Grammars : The Kuroda Normal Form, One sided Context SensitiveGrammars, Unrestricted LanguagesRegular Languages and Expressions : Idea of formal languages, Languages ofAutomata, Regular expressions, Converting Regular expressions to automataUnit IIITuring Machines : Representation, Language acceptability, Design & description ofTuring machines, Variants of Turing machines, Turing Machines Construction, TheChurch Turing thesis, Universal Turing MachineSyntax Analysis : Ambiguity and the formal power Series, Formal Properties of LL(k) and LR(k) Grammars

Individual Based on student performance (scores) Each question will be multiple of 5. Total marks will be 30.

5 / 6

Term Paper,Test 2 To understand the concept of turing machines as special emphasis is laid on design and applications of Turing Machines

Unit IVFormal Languages : Chomsky classification of languages, Languages and theirrelation, Linear Grammars and regular Languages, Regular Expressions, ContextSensitive LanguagesGrammars : Parsing and Derivation, Closure properties, Pigeonhole principal andpumping lemma, Constructing Regular grammarsUnit VDecidability : Decidable languages, Unpredictable languages, Halting problems ofTuring machinesComputability : Partial recursive functions, Basic concepts, Recursive functions,Partial RecursionComputers and the science of computing : Idea of computing, Computingmachines and languages, Programming and Data structuresUnit VIThe Chomsky Hierarchy : Enumerable Languages, Diagonalization, Acceptance andmembership, Recursive languages

Individual Based on student performance (scores) Each question will be multiple of 5. Total marks will be 30.

11 / 12

Term Paper,Test 3 To evaluate student performance

As per given topics Individual 30 Marks (Mid Term report- 5 marks, End Term report- 15 marks, Viva / presentation- 10 marks)

4 / 10

List of suggested topics for term paper[at least 15] (Student to spend about 15 hrs on any one specified term paper)

Sr. No. Topic

1 Theory of Automata

2 Finite Automata

3 Regular Languages

4 Context Free Grammars

5 Push Down Automata

6 Turing Machines and Computability

7 NFA and Regular Expressions

8 Regular Grammar and Languages

9 Computability

10 Context Free Languages

11 Grammars

12 Turing Machines

13 Chomsky Hierarchy

14 Computability and Undecidability

15 Deterministic Context Free Languages

Documents

Automata