Scribd
Upload
224 views2 pages

511CIT05 Formal Languages and Automata Theory LTPM C 3 1 0 100 4 Aim

This course aims to teach students about formal languages and automata theory. The course objectives are to understand finite state and pushdown automata, regular and context-free languages, and the relation between languages and their recognizers. The course covers topics like deterministic finite automata, regular expressions, context-free grammars, pushdown automata, Turing machines, and the Church-Turing thesis. The course is divided into 5 units covering these topics over 45 class periods.

Uploaded by

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

511CIT05 Formal Languages and Automata Theory LTPM C 3 1 0 100 4 Aim

This course aims to teach students about formal languages and automata theory. The course objectives are to understand finite state and pushdown automata, regular and context-free languages, and the relation between languages and their recognizers. The course covers topics like deterministic finite automata, regular expressions, context-free grammars, pushdown automata, Turing machines, and the Church-Turing thesis. The course is divided into 5 units covering these topics over 45 class periods.

Uploaded by

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

511CIT05 FORMAL LANGUAGES AND AUTOMATA THEORY

LT PM C
3 1 0 100 4
Aim:
This course aims to teach students to
To have an introductory knowledge of automata, formal language theory and
computability.
Objectives:
 To have an understanding of finite state and pushdown automata.
 To have a knowledge of regular languages and context free languages.
 To know the relation between regular language, context free language and
corresponding recognizers.
 To study the Turing machine Concepts.

UNIT I INTRODUCTION TO AUTOMATA 9


Mathematical preliminaries and notations - Central concepts of Automata Theory Basic
definitions–Deterministic Finite Automata (DFA), Non-Deterministic Finite Automata (NFA) –
Finite automata with Epsilon transitions –Equivalence of DFA`s and NFA`s - Applications of
finite state automata

UNIT II REGULAR EXPRESSIONS 9


Regular languages - Regular Expressions – Finite automata and regular expressions- Properties
of Regular Language-Pumping Lemma for Regular Language- Equivalence of Regular
Expression.

UNIT III CONTEXT FREE LANGUAGES


Closure properties of Regular Language, Minimization of Automata -Context Free languages:
Context Free Grammars - Parse Trees - Ambiguity in Grammars and languages - Applications
of Context Free Grammars- Properties of context free languages
UNIT IV NORMAL FORMS OF CFG AND PUSH DOWN AUTOMATA 9

Normal Forms- Chomsky Normal Form (CNF) and Griebach Normal Form (GNF)– Introduction
to Push Down Automata (PDA) – PDA definition – Equivalence of PDA and context free
language –Deterministic pushdown automata.

UNIT V TURING MACHINES

9
Church-Turing thesis: Turing machines - Language of a TM, TM as accepters and deciders.
Programming techniques for TM -Storage in state, multiple tracks, and subroutines. Variants of
Turing Machines-Universal Turing machine

TOTAL: 45 PERIODS
TEXT BOOK:
1. John E. Hopcroft and Rajeev Motwani and Jeffrey D. Ullman, “Introduction to Automata
Theory, Languages and Computation”, third edition, Pearson Education, New Delhi,
2013.

REFERENCE BOOKS:
1. S.N.Sivanadam , M.Janaki Meena, “ Theory of Computation” , I.K.International
Publishing House Pvt.Ltd, ISBN: 9789380026206, 2009.
2. Michael Sipser , “Introduction to the Theory of Computation”, third edition, PWS
Publications, Boston, 2013.
3. Peter Linz , “An Introduction to Formal Language and Automata”, fifth edition, Narosa
Publishers, New Delhi, 2011.

You might also like