Sie sind auf Seite 1von 17

Lovely Professional University, Punjab

Course Code

Course Title

Course Planner

Lectures

Tutorials

Practicals

Credits

CAP632

FORMAL LANGUAGES AND AUTOMATION THEORY

12962::Harjinder Kaur

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)

LTP week distribution: (LTP Weeks)

Weeks before MTE

7

Weeks After MTE

7

Spill Over

3

Detailed Plan For Lectures

Week

Lecture

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 Tool Demonstration/ Case Study / Images / animation / ppt etc. Planned

Live Examples

Number

Number

Week 1

Lecture 1

Automata(Definition)

T-1:Ch-1

AV-1

Introductory Lecture

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

Peer Learning,

Automata theory

Case Study

is

the basis for

Discussion and

the theory of formal languages

Demonstration of

Animation

Lecture 2

Automata(Description and transition modes)

T-1:Ch-3

AV-2

Complexity theory Computability theory Automata theory

Students will learn about the transition modes

Peer Learning,

Accept and

Case Study

Generate modes

 

Discussion and

   

Demonstration of

Animation

Lecture 3

Automata(NDFA and DFA)

T-1:Ch-3

DK-1

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

Makes it easy to design FSMs

Peer Learning,

DFA can model software that decides whether

Case Study

 

Discussion and

Demonstration of

or

not online

 

Animation

user-input such

as

email

addresses are

valid

Week 2

Lecture 4

Automata(Mealy and Moore machine)

T-1:Ch-3

DK-3

Variants of Finite automata

Students learn about Finite automata with output

Peer Learning,

A

simple Mealy

Case Study

machine has one input and one output,complex Mealy machines

   

Discussion and

 

Demonstration of

Animation

can have

multiple inputs

as

well as

multiple outputs

Automata(Minimization of Finite Automata)

T-1:Ch-3

AV-2

Deterministic finite

Students learn to reduce a Complex Finite Automata

Peer Learning,

Select one state

automata

and example

Case Study

in

each set of the

 

of a finite automata

Discussion and

partition final as the representative

 

Demonstration of

Animation

for the set. These representatives are states of minimum DFA

Week 2

Lecture 4

Automata(Constructing simple automata)

T-1:Ch-4

DK-2

Formal definition of a finite automaton

Students learn to Design finite automata

Peer Learning,

Defining Initial and Final States,Creating Transitions,Dele ting States and Transitions,Run ning the FA on Multiple Strings

Case Study

   

Discussion and

 

Demonstration of

Animation

Lecture 5

Automata(Handling end conditions)

T-1:Ch-4

OR-1

Regular operations of simple automata

Students learn the importance of Finite Automata conditions

Peer Learning,

Useful for specifying behavior of systems that are not expected to terminate, such as hardware, operating systems and control systems

Case Study

   

Discussion and

Demonstration of

 

Animation

Automata(Handling reject states)

T-1:Ch-4

OR-2

Proof techniques of automata states

Students learn the importance of Finite Automata states

Peer Learning,

All states have a transition for all possible input signals. If an input signal is considered 'illegal' it cannot be rejected

Case Study

   

Discussion and

Demonstration of

 

Animation

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

Peer Learning,

Defining Initial and Final States,Creating Transitions,Dele ting States and Transitions,Run ning the FA on Multiple Strings

Case Study

 

Discussion and

   

Demonstration of

Animation

Automata(States as

T-1:Ch-5

OR-2

To construct states to compute functions

Learn the importance of corresponding states

Peer Learning,

An automaton may also contain some extra memory in the form of a stack in which symbols can be pushed and popped

Memory)

Case Study

 

Discussion and

 

Demonstration of

Animation

Automata(Why finite number of states)

T-1:Ch-5

OR-1

Process and accept infinite sets if input strings

Students learn the importance of Automata states

Peer Learning,

vending

Case Study

machines

 

Discussion and

,elevators,traffic

   

Demonstration of

lights

Animation

Week 2

Lecture 5

Automata(Limitations of finite automata)

T-1:Ch-5

DK-2

Constructing automata to solve computing problems

Learn the Limitations

Peer Learning,

FA is that they have only a finite number of states. Hence, a finite automata can only "count" a finite number of input scenarios.

of

finite automata

Case Study

   

Discussion and

 

Demonstration of

Animation

Lecture 6

Automata(Non deterministic finite automata)

T-1:Ch-5

DK-3

Formal definition of a non deterministic finite automata

Learn the importance of NDFA Closure under the regular

Peer Learning,

Does not require input symbols for state transitions and is capable of transitioning to zero or two or more states for a given start state and input symbol

Case Study

 

Discussion and

 

operations

Demonstration of

Animation

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

T-1:Ch-5

AV-3

Relation between Finite Automata Regular Expressions

Any FSM can be

Peer Learning,

Works recursively by splitting an expression into its constituent subexpressions, from which the NFA will be constructed using a set of rules

converted to a regular expression, and every regular expression can be converted into

Case Study

Discussion and

 

Demonstration of

Animation

 

a

nondeterministic

FSM

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

T-1:Ch-5

DK-1

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

Peer Learning,

To prove a fact about all infinite regular languages that will be helpful in proving that specific languages are nonregular.

Case Study

Discussion and

 

Demonstration of

 

Animation

Week 3

Lecture 7

Pushdown Automata (Definition)

T-1:Ch-7

DK-2

Describing the basics of Push Down Automata

A

push down

Peer Learning,

They are more capable than finite-state machines but less capable than Turing machines.

automaton PDA or is

Case Study

   

a

type of automaton

Discussion and

that uses a stack for

Demonstration of

temporary data

Animation

storage

Week 3

Lecture 7

Pushdown Automata (Acceptance)

T-1:Ch-7

AV-2

Types of acceptance by Pushdown Automata

Students learn about the technique for acceptance of string

Peer Learning,

The first acceptance mode uses the internal memory (state), the second the external memory (stack).

Case Study

   

Discussion and

 

Demonstration of

Animation

Pushdown Automata (Pushdown Automata and Context Free Languages)

T-1:Ch-7

OR-1

Relationship between Push down Automata and Context Free Languages

Learn about Connection between Push down Automata

Peer Learning,

When the grammar rewrites a nonterminal, the PDA takes the topmost nonterminal from its stack and replaces it by the right- hand part of a grammatical rule

Case Study

Discussion and

   

Demonstration of

 

and Context Free Languages

Animation

Lecture 8

Pushdown Automata (Parsing and Pushdown automata)

T-1:Ch-7

OR-2

Purpose of Parsing in automata

Learn about Top Down and Bottom Up Parsing

Peer Learning,

Top down and bottom up parsing

Case Study

 

Discussion and

   

Demonstration of

 

Animation

Pushdown Automata (Constructing PDAs)

T-1:Ch-7

DK-3

To teach about the construction of PDA

Students solve the examples of push down automata

Peer Learning,

Regarded as being "pushed down" like a tray dispenser at a cafeteria, since the operations never work on elements other than the top element

Case Study

   

Discussion and

 

Demonstration of

Animation

Lecture 9

Pushdown Automata (Converting CFGs to PDAs)

T-1:Ch-7

AV-1

Designing PDAs from context free grammars

Ways to simplify CFGs

Peer Learning,

For each pushdown automaton M one may construct a context-free grammar G such that N(M)=L(G)

Case Study

     

Discussion and

Demonstration of

Animation

Pushdown Automata (Converting PDAs to CFGs)

T-1:Ch-7

AV-3

Designing PDAs to CFGs

Ways to simplify PDAs

Peer Learning,

using the tools under the “Convert ? Convert to Grammar” menu option using JFLAP

Case Study

     

Discussion and

Demonstration of

Animation

Week 3

Lecture 9

Context Free languages (Derivation trees)

T-1:Ch-6

DK-1

Other way of representing a CFG

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

Peer Learning,

if

we used a

 

Case Study

production A : :

   

Discussion and

=

X1X2

Xn

(in

Demonstration of

either top-down

 

Animation

or bottom-up parsing) then we

construct a tree with node A and children X1X2 Xn

Week 4

Lecture 10

Context Free languages (Ambiguity in Context free grammars)

T-1:Ch-6

AV-3

To ambiguity in context free grammars

Students learn the importance of Ambiguity with the help of examples

Peer Learning,

When there's a word which has two different derivation tree

Case Study

 

Discussion and

 

Demonstration of

 

Animation

 

Context Free languages (Simplification of context free grammars)

T-1:Ch-6

AV-2

Equivalence with context free grammars

Students learn the ways to equivalent context free grammars

Peer Learning,

Precise mechanism for describing the methods by which phrases in some natural language are built from smaller blocks, capturing the "block structure" of sentences in a natural way

Case Study

 

Discussion and

 

Demonstration of

 

Animation

Lecture 11

Context Free languages(The Chomsky & Greibach Normal Forms)

R-1:Ch-4

AV-3

Describing CNF

Students learn to reduce grammar to a CNF

Peer Learning,

Normal form usually used in algebraic specifications

R-2:ch-6

Case Study

Discussion and

   

Demonstration of

Animation

 

Context Free Grammars(The Kuroda Normal Form)

R-3:Ch-6

AV-1

DescribingKuroda

Students learn the importance of KNF

Peer Learning,

Every context- sensitive language which does not generate the empty string can be generated by

Normal Form

Case Study

   

Discussion and

Demonstration of

Animation

a

grammar in

 

Kuroda normal

form

 

Lecture 12

Context Free Grammars (One sided Context Sensitive Grammars)

R-3:Ch-6

OR-1

Elaborates concept of KNF

Learns about the implementation of KNF

Peer Learning,

Noncontracting grammar or a linear bounded automaton

Case Study

 

Discussion and

   

Demonstration of

Animation

 

Week 4

Lecture 12

Context Free Grammars (Unrestricted Languages)

R-3:Ch-6

DK-2

Implementation for

Learn the usage of restrictions

Peer Learning,

Grammars make

making restrictions

Case Study

no real

   

Discussion and

distinction

Demonstration of

between

Animation

nonterminal and

terminal

symbols

Regular Languages and Expressions(Idea of formal languages)

R-3:Ch-6

AV-1

Introduction to formal language

Learn the concept of formal language

Peer Learning,

Every nonempty string that does not contain "+" or "=" and does not start with "0" is in L.

Case Study

   

Discussion and

 

Demonstration of

Animation

Week 5

Lecture 13

Regular Languages and Expressions(Languages of Automata)

R-3:Ch-6

OR-1

Highlights on Automata

Understands the concept of automaton

Peer Learning,

Generative

Case Study

model ,language

 

Discussion and

model

 

Demonstration of

Animation

Regular Languages and Expressions(Regular expressions)

R-3:Ch-6

DK-2

Recursive definition

Learn to construct simple regular expression

Peer Learning,

The set of strings over {0,1} that end in 3 consecutive

Case Study

Discussion and

   

Demonstration of

Animation

1's.

(0 | 1)* 111

Regular Languages and Expressions(Converting Regular expressions to automata)

R-3:Ch-6

AV-2

Mapping from elements of regular expression to NFA

Learn to convert regular expression to equivalent automata

Peer Learning,

JLex, is to generate the transition tables or to synthesize the scanner program given a scanner specification

Case Study

Discussion and

   

Demonstration of

 

Animation

Lecture 14

Turing Machines

T-1:ch-9

AV-1

Ways to design Turing Machines

Understands about Formal definition of a Turing machine

Peer Learning,

It consists of an infinitely-long tape which acts like the memory in a typical computer, or any other form of data storage

(Representation)

Case Study

 

Discussion and

 

Demonstration of

Animation

Week 5

Lecture 14

Turing Machines(Language acceptability)

T-1:ch-9

AV-3

Examples of Turing machines and computable functions

Learn to construct turing machines

Peer Learning,

A

string x is said

Case Study

to

be accepted

   

Discussion and

by a Turing

 

Demonstration of

machine* T = <

Animation

Q

, , , q0 , > if

( q0 , x ) * ( h,

yaz ) for some symbol a {} and some strings y and z in ( {} )

Turing Machines(Design & description of Turing machines)

T-1:ch-9

OR-2

Constructing complex turing machines

Learn techniques for constructing turing machines

Peer Learning,

Hypothetical

Case Study

device that

 

Discussion and

manipulates

   

Demonstration of

symbols on a strip of tape according to a table of rules

Animation

Lecture 15

     

Term Paper,Test 1

     

Week 6

Lecture 16

Turing Machines(Variants of Turing machines)

T-1:ch-9

AV-1

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

Understand design variation for turing machines

Peer Learning,

read-only Turing

Case Study

machine or

 

Discussion and

Two-way

 

Demonstration of

deterministic

 

Animation

finite-state

automaton

Turing Machines(Turing Machines Construction)

T-1:ch-9

AV-3

Techniques used for constructing turing machines

Understands the methods used for designing turing machines

Peer Learning,

( q , aababb )

Case Study

shows that the Turing machine

 

Discussion and

 

Demonstration of

is

currently in

 

Animation

state q, the taper contents are the string aababb and the head is reading the last a of the string.

Turing Machines(The Church Turing thesis)

T-1:ch-9

OR-2

Alogrithm for Church Turing thesis

Learns about the concept of church turing

Peer Learning,

States that a function is

Case Study

   

Discussion and

algorithmically

 

Demonstration of

computable if and only if it is computable by a Turing machine.

Animation

Lecture 17

Turing Machines(Universal Turing Machine)

T-1:ch-9

OR-3

Stored program

Understands working of UTM

Peer Learning,

Electronic

computer

Case Study

Computing

   

Discussion and

Instrument" that now bears von

Demonstration of

Animation

Neumann's

name: the von

Neumann

architecture

Week 6

Lecture 18

Syntax Analysis(Ambiguity and the formal power Series)

T-1:ch-9

DK-1

Eliminating ambiguity

Understands the procedure to remove ambiguity

Peer Learning,

Topology,Opera

DK-2

Case Study

tions, Universal

 

Discussion and

property

 

Demonstration of

Animation

Week 7

Lecture 19

Syntax Analysis(Formal

T-1:ch-9

DK-3

L19 Parsing strategies

Learns about the features of LL and LR

Peer Learning,

They are easy to parse, either by LL parsers or by recursive descent parsers, and many computer languages are designed to be LL(1) for this reason

Properties of LL(k) and LR

Case Study

(k)

Grammars)

L20 is revision L21 is revision

Discussion and

   

Demonstration of

 

Animation

Lecture 20

Syntax Analysis(Formal

T-1:ch-9

DK-3

L19 Parsing strategies

Learns about the features of LL and LR

Peer Learning,

They are easy to parse, either by LL parsers or by recursive descent parsers, and many computer languages are designed to be LL(1) for this reason

Properties of LL(k) and LR

Case Study

(k)

Grammars)

L20 is revision L21 is revision

Discussion and

   

Demonstration of

 

Animation

Lecture 21

Syntax Analysis(Formal Properties of LL(k) and LR

T-1:ch-9

DK-3

L19 Parsing strategies

Learns about the features of LL and LR

Peer Learning,

They are easy to parse, either by LL parsers or by recursive descent parsers, and many computer languages are designed to be LL(1) for this reason

Case Study

(k)

Grammars)

L20 is revision L21 is revision

Discussion and

   

Demonstration of

 

Animation

   

MID-TERM

 

Week 8

Lecture 22

Formal Languages(Chomsky classification of languages)

R-2:ch-7

OR-1

Definition of grammar

Learn the difference between different types of ets

Peer Learning,

ts terminals are the letters of $ \Sigma$, its non-terminals are the states of the automaton $ \cal {A}$, its start-symbol is the initial state of $ \cal {A}$,

AV-1

Case Study

 

AV-3

Discussion and

 

Demonstration of

Animation

Week 8

Lecture 23

Formal Languages (Languages and their relation)

R-2:ch-7

DK-2

Formal Language and their relation

Understand about the relation of formal languages

Peer Learning,

Studies primarily the purely syntactical aspects of such languages—that is, their internal structural patterns.

Case Study

 

Discussion and

   

Demonstration of

Animation

Lecture 24

Formal Languages(Linear Grammars and regular Languages)

R-2:ch-7

OR-2

Linear grammar

Understand the concept of Linear grammar

Peer Learning,

Left-linear and

Case Study

Right-linear

Discussion and

grammers

   

Demonstration of

Animation

Week 9

Lecture 25

Formal Languages(Regular Expressions)

R-2:ch-5

OR-2

Definition of regular expression

Learn to construct simple regular expression

Peer Learning,

regexp ?

OR-3

Case Study

switches? exp

   

Discussion and

string ?

 

Demonstration of

matchVar? ?

Animation

subMatchVar

subMatchVar

?

Lecture 26

Formal Languages(Context Sensitive Languages)

R-2:ch-5

OR-2

Context sensitive

Learn about the concept of CSL

Peer Learning,

The union, intersection, concatenation and Kleene star of two context- sensitive languages is context-sensitive

Language

Case Study

   

Discussion and

Demonstration of

Animation

Lecture 27

Grammars(Parsing and Derivation)

R-2:ch-5

AV-1

Introduction to parsing

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

Peer Learning,

Unambiguous and context-free grammars can be constructed that produce parse trees that obey all desired operator precedence and associativity rules.

Case Study

 

Discussion and

Demonstration of

 

Animation

Week 10

Lecture 28

Grammars(Closure

R-2:ch-5

DK-3

Union,concatenation,co mpliment , reversal

Learn to use closure properties to obtain more complex regular language

Peer Learning,

The regular

properties)

Case Study

operations:

 

Discussion and

union K \cup L, concatenation K \circ L, and Kleene star L^*

Demonstration of

 

Animation

Week 10

Lecture 29

Grammars(Pigeonhole principal and pumping lemma)

R-2:ch-6

AV-1

Adversarial Game

Learn to handle regular languages with repeating patterns

Peer Learning,

Pumping lemma

Case Study

for regular

Discussion and

languages and

 

Demonstration of

the pumping

 

Animation

lemma for

context-free

languages and

Ogden's lemma

Lecture 30

Grammars(Constructing Regular grammars)

R-2:ch-6

AV-2

Introduction to regular grammars

Learn to construct regular expression for user dat avalidation

Peer Learning,

If L is regular i.e. accepted by an NFA, then L - {} is generated by a regular grammar.

Case Study

   

Discussion and

 

Demonstration of

Animation

Week 11

Lecture 31

Decidability(Decidable

T-1:Ch-10

OR-2

Decidable problems

Understands kinds of problems that are undecidable

Peer Learning,

Let A contain all even-length strings, plus an undecidable collection of odd-length strings. Let B contain all odd- length strings concatenation AB consists of all strings and hence is decidable

languages)

AV-2

concerning regular

Case Study

languages

Discussion and

 

Demonstration of

Animation

Lecture 32

Decidability(Unpredictable

T-1:Ch-10

OR-3

Decidability and Unpredictable languages

Understand the

Peer Learning,

Unpredictability approach for defining randomness in which the preditions are carried out by finite-state automata.

languages)

concept of

Case Study

 

Unpredictable

Discussion and

languages

Demonstration of

Animation

Lecture 33

Decidability(Halting problems of Turing machines)

T-1:Ch-10

OR-2

Problems in halting Turing machines

Understanding the halting problem of turing machines

Peer Learning,

Given a description of an arbitrary computer program, decide whether the program finishes running or continues to run forever

DK-2

Case Study

 

Discussion and

   

Demonstration of

Animation

Week 12

Lecture 34

Computability(Partial recursive functions)

T-1:Ch-11

OR-1

Computability and turing model for computation

Understands various functions performed by partial recursive

Peer Learning,

Addition,Subtra ction,Operations on integers and rational numbers

Case Study

 

Discussion and

   

Demonstration of

Animation

 

Week 12

Lecture 35

Computability(Basic

T-1:Ch-11

AV-3

Steps of Computability

Understands about

Peer Learning,

Turing-

concepts)

concepts of

Case Study

computable and

computability

Discussion and

µ-recursive

Demonstration of

functions, and

Animation

the lambda

calculus

Computability(Recursive

T-1:Ch-11

OR-1

Computability

Understands

Peer Learning,

Tower of hanoi

functions)

Recursive functions

computability

Case Study

,factorial,fibnacc

recursive functions

Discussion and

i

Demonstration of

Animation

Computability(Partial

T-1:Ch-11

DK-1

Partial functions

Understands concept of partial recursive functions

Peer Learning,

1)Function

Recursion)

Case Study

symbols (for example, f, g, h, etc.), (2) variables for

Discussion and

 

Demonstration of

Animation

nonnegative

integers (for example, x, y, z,

etc.), (3) the constant 0, and (4) the successor function S(x)=x

+1.

Lecture 36

     

Term Paper,Test 2

     

Week 13

Lecture 37

Computers and the science of computing(Idea of computing)

R-2:ch-12

DK-1

Concept of computing

Learn the importance of Computing machines

Peer Learning,

A

variety of

Case Study

minor

Discussion and

enhancements to this basic scheme are possible, and there are many ways to save

unnecessary

   

Demonstration of

Animation

computation

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

R-2:ch-12

DK-2

Introduction of computing machines

Understands the working of computing machines

Peer Learning,

Turing

Case Study

machine,Finite

 

Discussion and

sate machines

   

Demonstration of

Animation

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

T-1:Ch-11

AV-2

Data structures used in programming

Understands the need of data structures

Peer Learning,

For exploring large patterns at great time-

DK-1

Case Study

 

Discussion and

   

Demonstration of

depths,

Animation

sophisticated

algorithms such

as

Hashlife may

be useful.

Week 13

Lecture 38

The Chomsky Hierarchy (Diagonalization)

R-2:ch-11

OR-2

Chomsky Hierarchy problems

Understand the concept of Chomsky Hierarchy

Peer Learning,

Let R be a binary relation on a set A and let D = {a|a ? A, and (a, a) ? R}. For each a ? A, let Ra = {b|b ? A, and (a, b) ? R}. Then D is distinct from Ra for all a ? A.

DK-3

Case Study

   

Discussion and

 

Demonstration of

Animation

The Chomsky Hierarchy (Enumerable Languages)

R-2:ch-11

OR-1

Parsing with CNF

Learns about the techniques for parsing

Peer Learning,

Recognizable,

Case Study

partially

 

Discussion and

decidable,

 

Demonstration of

semidecidable

Animation

or

Turing-

acceptable

Lecture 39

The Chomsky Hierarchy (Acceptance and membership)

R-2:ch-11

AV-3

Chomsky Acceptance

Understands concept of acceptance and membership

Peer Learning,

A

Streett

Case Study

automaton is an ?-automaton A that uses the following acceptance condition, for some set O of pairs (Ei,Fi) of sets of states

Discussion and

   

Demonstration of

Animation

Week 14

Lecture 40

The Chomsky Hierarchy (Recursive languages)

R-2:ch-11

AV-3

L40

Understand the need of recursive languages

Peer Learning,

Universal

Recursive languages in The Chomsky Hierarchy

Case Study

Turing Machine

 

Discussion and

and Linear

   

Demonstration of

Bounded

L41 is revision L42 is revision

Animation

Automata

Lecture 41

The Chomsky Hierarchy (Recursive languages)

R-2:ch-11

AV-3

L40

Understand the need of recursive languages

Peer Learning,

Universal

Recursive languages in The Chomsky Hierarchy

Case Study

Turing Machine

 

Discussion and

and Linear

   

Demonstration of

Bounded

L41 is revision L42 is revision

Animation

Automata

Lecture 42

The Chomsky Hierarchy (Recursive languages)

R-2:ch-11

AV-3

L40

Understand the need of recursive languages

Peer Learning,

Universal

Recursive languages in The Chomsky Hierarchy

Case Study

Turing Machine

 

Discussion and

and Linear

   

Demonstration of

Bounded

L41 is revision L42 is revision

Animation

Automata

   

SPILL OVER

 

Week 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 I Automata : Definition, Description and transition modes, NDFA and DFA, Mealy and Moore machine, Minimization of Finite Automata, Constructing simple automata, Handling end conditions, Handling reject states, Step by step method for constructing automata, States as Memory, Why finite number of states, Limitations of finite automata, Non deterministic finite automata Construction of Finite Automata : Construction of Finite Automata equivalent to Regular expression & vice versa, Pumping Lemma for regular sets & its applications Pushdown Automata : Definition, Acceptance, Pushdown Automata and Context Free Languages, Parsing and Pushdown automata, Constructing PDAs, Converting CFGs to PDAs, Converting PDAs to CFGs Unit II Context Free languages : Derivation trees, Ambiguity in Context free grammars, Simplification of context free grammars, The Chomsky & Greibach Normal Forms Context Free Grammars : The Kuroda Normal Form, One sided Context Sensitive Grammars, Unrestricted Languages Regular Languages and Expressions : Idea of formal languages, Languages of Automata, Regular expressions, Converting Regular expressions to automata Unit III Turing Machines : Representation, Language acceptability, Design & description of Turing machines, Variants of Turing machines, Turing Machines Construction, The Church Turing thesis, Universal Turing Machine Syntax 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 IV Formal Languages : Chomsky classification of languages, Languages and their relation, Linear Grammars and regular Languages, Regular Expressions, Context Sensitive Languages Grammars : Parsing and Derivation, Closure properties, Pigeonhole principal and pumping lemma, Constructing Regular grammars Unit V Decidability : Decidable languages, Unpredictable languages, Halting problems of Turing machines Computability : Partial recursive functions, Basic concepts, Recursive functions, Partial Recursion Computers and the science of computing : Idea of computing, Computing machines and languages, Programming and Data structures Unit VI The Chomsky Hierarchy : Enumerable Languages, Diagonalization, Acceptance and membership, 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

4 / 10

Term report- 5 marks, End Term report- 15 marks,

 

Viva / presentation-

10

marks)

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