Scribd
Upload
18 views1 page

R2023 CSBS Curriculum & Syllabus Batch 2024 2025-69-93 4

The document outlines a course on Formal Language and Automata Theory, focusing on foundational concepts in computation, including automata theory, regular expressions, context-free grammars, and Turing machines. It covers various units such as finite automata, regular and context-free languages, pushdown automata, Turing machines, and undecidability and complexity. The course aims to provide a comprehensive understanding of computational models and their capabilities.

Uploaded by

loganaththiruvel
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
18 views1 page

R2023 CSBS Curriculum & Syllabus Batch 2024 2025-69-93 4

The document outlines a course on Formal Language and Automata Theory, focusing on foundational concepts in computation, including automata theory, regular expressions, context-free grammars, and Turing machines. It covers various units such as finite automata, regular and context-free languages, pushdown automata, Turing machines, and undecidability and complexity. The course aims to provide a comprehensive understanding of computational models and their capabilities.

Uploaded by

loganaththiruvel
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

L T P C

23CB1302 FORMAL LANGUAGE AND AUTOMATA


THEORY 3 0 0 3

COURSE OBJECTIVE:
 To understand foundations of computation including automata theory
 To construct models of regular expressions and languages

To design context free grammar and push down automata

To understand Turing machines and their capability
 To understand Undecidability and NP class problems
UNIT - I INTRODUCTION AND FINITE AUTOMATA 9
Introduction : Alphabet- languages and grammars- productions and derivation - Chomsky
hierarchy of languages.
Finite automata: Regular expressions - Deterministic Finite Automata (DFA) and
equivalence with regular expressions - Nondeterministic Finite Automata (NFA) and equivalence
with DFA, Myhill-Nerode theorem and its uses - Minimization of finite automata.

UNIT - II REGULAR LANGUAGES AND CONTEXT-FREE LANGUAGES 9


Regular Languages : Introduction - Regular grammars and equivalence with finite automata -
properties of regular languages- Kleene‟s theorem - pumping lemma for regular languages.
CONTEXT-FREE LANGUAGES : Context-free grammars (CFG) and languages (CFL) -
Chomsky and Greibach normal forms.

UNIT - III PUSHDOWN AUTOMATA 9


Pushdown Automata: Nondeterministic pushdown automata (PDA) and equivalence with CFG -
parse trees- ambiguity in CFG - pumping lemma for context-free languages - deterministic
pushdown automata, closure properties of CFLs .
Context-sensitive grammars (CSG) and languages- linear bounded automata and equivalence
with CSG.

UNIT - IV TURING MACHINES 9

The basic model for Turing machines (TM) - Turing recognizable(recursively enumerable) and
Turing - decidable (recursive) languages and their closure properties - variants of Turing
machines - nondeterministic TMs and equivalence with deterministic TMs - unrestricted
grammars and equivalence with Turing machines – TMs as enumerators.

UNIT - V UNDECIDABILITY AND COMPLEXITY 9


Undecidability :Church-Turing thesis - universal Turing machine - the universal and
diagonalization languages - reduction between languages and Rice‟s theorem - undecidable
problems about languages
Basic Introduction to Complexity : Introductory ideas on Time complexity of deterministic and
nondeterministic Turing machines - P and NP, NP – completeness - Cook‟s Theory - other NP
- Complete problems.

TOTAL : 45 PERIODS

You might also like