Course L T P C

Course Code 18CSC301T Course Name FORMAL LANGUAGE AND AUTOMATA C Professional Core
Category 3 0 0 3

Pre-requisite Co-requisite Progressive

Nil Nil Nil
Courses Courses Courses
Course Offering Department Computer Science and Engineering Data Book / Codes/Standards Nil

Course Learning Rationale (CLR): The purpose of learning this course is to: Learning Program Learning Outcomes (PLO)
CLR-1 : Utilize the mathematics and engineering principles for the basics of Formal Language 1 2 3 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
CLR-2 : Acquire knowledge of Automata and minimize with Regular language's

Environment & Sustainability

Analysis, Design, Research
CLR-3 : Acquire knowledge of Context free Grammar and simplify using normal forms

Level of Thinking (Bloom)

Expected Proficiency (%)

Expected Attainment (%)

Individual & Team Work

Engineering Knowledge
CLR-4 : Gain knowledge to push down automata and apply it with CFL

Design & Development

Project Mgt. & Finance

CLR-5 : Analyze the methods of turning machine

Modern Tool Usage

Life Long Learning

Society & Culture
Problem Analysis
CLR-6 : Analyze and Design the methods of computational complexity

Communication

PSO – 3
PSO - 1

PSO - 2
Ethics
Course Learning Outcomes (CLO): At the end of this course, learners will be able to:
CLO-1 : Acquire the knowledge of mathematics and engineering principles for the basics of Formal Language 3 80 70 M H - H L - - - L L - H - - -
CLO-2 : Acquire the ability to identify specification of a Regular language's with Automata 3 85 75 M H L M L - - - M L - H - - -
CLO-3 : Acquire knowledge of Context free Grammar and simplify using normal forms 3 75 70 M H M H L - - - M L - H - - -
CLO-4 : Understand the concepts of push down automata and CFL . 3 85 80 M H M H L - - - M L - H - - -
CLO-5 : Apply the knowledge to turning machine and its methods 3 85 75 H H M H L - - - M L - H - - -
CLO-6 : Design the computational and acceptor machines using FA, PDA and Turing machines 3 80 70 L H - H L - - - L L - H - - -

Duration (hour) 11 9 9 9 7
Grammars: Introduction: Types of Pushdown Automata: Definitions Moves Turing Machines: Introduction Undecidability :Basic definitions
SLO-1 Introduction to Automaton
Grammar
S-1
Context Free Grammars and Languages Instantaneous descriptions Formal definition of Turing machines, Decidable problems,
SLO-2 Mathematical concepts
Instantaneous descriptions
Formal Languages: Strings, Languages, Derivations Deterministic pushdown automata Turing Machine as Acceptors Examples of undecidable problems and
SLO-1
Properties Problems
S-2
Finite Representation : Regular Ambiguity Problems related to DPDA Problems related to turning machine as Rice’s Theorem
SLO-2
Expressions Acceptors
Relationship between derivation and Non - Deterministic pushdown automata Problems related to turning machine as
Undecidable problems about Turing
SLO-1 Problems related to regular expressions
derivation trees Acceptors
Machine- Post’s Correspondence Problem
S-3
Finite Automata :Deterministic Finite Problems related to Context free Grammar Problems related to NDPDA Problems related to Post’s
SLO-2
Automata Correspondence Problem
SLO-1 Nondeterministic Finite Automata Simplification of CFG : Elimination of Problems related to DPDA and NDPDA Turing Machine as a Computing Device Properties of Recursive and Recursively
S-4 Useless Symbols Problems related to turning Turing Machine enumerable languages
SLO-2 Finite Automaton with €- moves
as a Computing Device
Problems related to Deterministic and Simplification of CFG : Unit productions Pushdown automata to CFL Equivalence Problems related to turning Turing Machine Introduction to Computational Complexity:
SLO-1
Nondeterministic Finite Automata as a Computing Device Definitions
S-5
Problems related to Finite Automaton with Simplification of CFG : Null productions Problems related to Equivalence of PDA to Time and Space complexity of TMs
SLO-2
€- moves CFG
Problems related to Simplification of CFG Problems related to Equivalence of PDA to Techniques for Turing Machine Complexity classes: Class P, Class NP
SLO-1 Equivalence of NFA and DFA
S-6 CFG Construction
SLO-2 Heuristics to Convert NFA to DFA
Equivalence of NDFA’s with and without €- Chomsky normal form CFL to Pushdown automata Equivalence Considering the state as a tuple Complexity classes: Introduction to NP-
SLO-1
S-7 moves Considering the tape symbol as a tuple Hardness
SLO-2 Problems related Equivalence of NDFA’s Problems related to CNF Problems related to Equivalence of CFG Checking off symbols NP Completeness
 with and without €-moves to PDA
SLO-1 Minimization of DFA Greiback Normal form Pumping lemma for CFL Modifications of Turing Machine
S-8
SLO-2 Problems related to Minimization of DFA Multi-tape Turing Machine
Regular Languages : Equivalence of Finite Problems related to GNF Problems based on pumping Lemma Non-Deterministic Turing Machine
SLO-1
Automata and Regular Languages
S-9
Equivalence of Finite Automata and Semi-Infinite Tape Turing Machine
SLO-2
Regular Grammars
Problems related to Equivalence of Finite
SLO-1 Automata and Regular Languages and
S-10 Regular Grammars
Variants of Finite Automata :Two-way
SLO-2
Finite Automaton Mealy Machines
Properties of Regular Languages: Closure
SLO-1
Properties
S-11 Set Theoretic Properties & Other
SLO-2
Properties
SLO-3 Pumping Lemma

4..John.C.Martin, “Introduction to Languages and the Theory of Computation” McGraw-Hill Education, 01- May-
1.Hopcroft J.E., Motwani R. and Ullman J.D, “Introduction to Automata Theory, Languages and 2010.
Learning
Computations”, Second Edition, Pearson Education, 2008. 5. Kamala Krithivasan, Rama.R,” Introduction to Formal Languages, Automata Theory and Computation”,
Resources
2. Michael Sipser, “Introduction to the Theory of Computation” Cengage Learning, 2012. Pearson Education India, 01-Sep-2009.
6. Peter Linz , “An introduction to formal languages and automata”, Jones & Bartlett Learning, 2001.

Learning Assessment
Continuous Learning Assessment (50% weightage)
Bloom’s Final Examination (50% weightage)
CLA – 1 (10%) CLA – 2 (15%) CLA – 3 (15%) CLA – 4 (10%)#
Level of Thinking
Theory Practice Theory Practice Theory Practice Theory Practice Theory Practice
Remember
Level 1 40 % - 30 % - 30 % - 30 % - 30% -
Understand
Apply
Level 2 40 % - 40 % - 40 % - 40 % - 40% -
Analyze
Evaluate
Level 3 20 % - 30 % - 30 % - 30 % - 30% -
Create
Total 100 % 100 % 100 % 100 % 100 %
# CLA – 4 can be from any combination of these: Assignments, Seminars, Tech Talks, Mini-Projects, Case-Studies, Self-Study, MOOCs, Certifications, Conf. Paper etc.,

Course Designers
Experts from Industry Experts from Higher Technical Institutions Internal Experts
Dr.R.AnnieUthra
Dr.Jeyasudha