Scribd
Upload
65 views2 pages

FLAT Syllabus

The document outlines the course structure for 'Formal Languages and Automata Theory' for third-year B.Tech students, detailing course objectives, outcomes, assessment methods, and a comprehensive syllabus. Key topics include finite automata, regular expressions, grammars, pushdown automata, and Turing machines, along with their applications and limitations. Required textbooks and reference materials are also provided for further study.

Uploaded by

prachi.wagde
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
65 views2 pages

FLAT Syllabus

The document outlines the course structure for 'Formal Languages and Automata Theory' for third-year B.Tech students, detailing course objectives, outcomes, assessment methods, and a comprehensive syllabus. Key topics include finite automata, regular expressions, grammars, pushdown automata, and Turing machines, along with their applications and limitations. Required textbooks and reference materials are also provided for further study.

Uploaded by

prachi.wagde
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Program: Third Year B.Tech.

Semester: V L P C
Formal Languages and Automata Theory Course Code: CMCR0501 3 0 3

Course Objectives:
1 To acquire conceptual understanding of fundamentals of grammars and languages.

2 To develop understanding of different computational models and their applications.

Course Outcomes:
After successful completion of this course, the students should be able to
CO 1: Develop Regular grammar, Context free grammar while recognizing the strings and tokens.
Develop Regular Expression for a given language and show the equivalence of languages described
CO 2: by finite automata and regular expressions.
Construct Finite Automata, Pushdown Automata and Turing Machines to recognize the given
CO 3: language and prove the equivalence between them.
CO 4: Identify applications and limitations of computational models.

Pre-requisite courses: Discrete Structure

Course Assessment Methods:

DIRECT

1. Continuous Internal Assessment (Theory component)


2. Assignments/Tutorials/Power-point-presentation/Group-discussion/Quiz/seminar/Case
Studies/Design Thinking/Innovation/Creativity(Blog writing/Vlogging, etc).
3. Pre/Post - Experiment Test/Viva; Experimental Write-Up for each Experiment, Day to Day Experiments
/Assignments/Tutorials/Power-point-presentation/Group-Discussion/Quiz/seminar/ Case
studies/Design Thinking/Innovation/Creativity(Blog writing/Vlogging,etc)(Laboratory Component)
4. End Semester Examination (Theory and Laboratory components).

INDIRECT

1. Course-end survey
2. Activity based survey (if any)

Shah & Anchor Kutchhi Engineering College, B.Tech. in Computer Engineering R0-V0-2024-25 6
DETAILED SYLLABUS
Module 1: Finite Automata, Regular Expressions and Languages 13 Hours
1.1 Importance of the course, Basic concepts- Alphabets, Strings, Languages.
1.2 Finite Automata (FA), Deterministic Finite Automata (DFA) and Nondeterministic Finite Automata (NFA):
Definitions, transition diagrams and Language recognizers, Equivalence between NFA with and
without ε- transitions, NFA to DFA Conversion, Minimization of DFA.
1.3 FA with output: Moore and Mealy machines.
1.4 Regular Expression (RE), Equivalence of RE and FA using Arden’s Theorem, Regular Language (RL) ,
Closure properties of RLs, Decision properties of RLs, Pumping lemma for RLs.
1.5 Regular Grammar (RG) , Equivalence of RG and FA.
1.6 Applications and limitations of FA.
Module 2: Grammars 12 Hours
2.1 Chomsky hierarchy, Context Free Grammar (CFG) - Definition, Sentential forms, Leftmost and Rightmost
derivations, Parse tree, Ambiguity, Simplification and Applications.
2.2 Normal Forms: Chomsky Normal Forms (CNF) and Greibach Normal Forms (GNF).
2.3 Context Free language (CFL), Pumping lemma for CFL, Closure properties of CFL.
Module 3: Pushdown Automata 06 Hours
3.1 Definition, Language of Pushdown Automata (PDA), PDA as generator, decider and acceptor of CFG,
Deterministic PDA , Nondeterministic PDA, Applications of PDA.
Module 4: Turing Machine 08 Hours
4.1 Definition, Design of Turing Machine (TM) as generator, decider and acceptor, Variants of TM: Multitrack,
Multitape, Universal TM, Applications, Power and Limitations of TMs.
4.2 Decidability and Undecidability, Recursive and Recursively Enumerable Languages, Halting Problem, Post
Correspondence Problem.

Lecture: 3 Hrs./Week Total Hours: 39 Hrs.

Textbooks:
1. John E. Hopcroft, Rajeev Motwani, Jeffery D. Ullman, Introduction to Automata Theory, Languages
and Computation, 3rd Edition, Pearson Education.
2. Michael Sipser, Theory of Computation, 3rd Edition, Cengage learning.
3. Vivek Kulkarni, Theory of Computation, Illustrated Edition, Oxford University Press, India.

Reference Books:
1. J. C. Martin, Introduction to Languages and the Theory of Computation, 4th Edition, Tata McGraw Hill
Publication.
2. Kavi Mahesh, Theory of Computation: A Problem Solving Approach, Kindle Edition, Wiley-India.

Shah & Anchor Kutchhi Engineering College, B.Tech. in Computer Engineering R0-V0-2024-25 7

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy