Scribd
Upload
8 views1 page

SYLLABUS FLATdocx 2024 09 19 13 38 55docx 2025 07 07 10 25 33

The syllabus outlines the course structure for FLAT (BTCS-502-18) in the 5th semester of CSE, covering key topics in formal languages and automata theory. It includes modules on regular languages, context-free languages, context-sensitive languages, Turing machines, and undecidability and intractability, with specified hours for each module. Each module focuses on essential concepts, definitions, and properties relevant to theoretical computer science.

Uploaded by

Pardeep
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
8 views1 page

SYLLABUS FLATdocx 2024 09 19 13 38 55docx 2025 07 07 10 25 33

The syllabus outlines the course structure for FLAT (BTCS-502-18) in the 5th semester of CSE, covering key topics in formal languages and automata theory. It includes modules on regular languages, context-free languages, context-sensitive languages, Turing machines, and undecidability and intractability, with specified hours for each module. Each module focuses on essential concepts, definitions, and properties relevant to theoretical computer science.

Uploaded by

Pardeep
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/ 1

SYLLABUS

Subject: FLAT Subject Code: BTCS-502-18 Semester: CSE 5th


Module1: Introduction:
Alphabet, languages and grammars, productions and derivation, Chomsky hierarchy of
languages.

[3hrs] (CO1)
Module2: Regular languages and finite automata:
Regular expressions and languages, deterministic finite automata (DFA) and equivalence with
regular expressions, nondeterministic finite automata (NFA) and equivalence with DFA,
regular grammars and equivalence with finite automata, properties of regular languages,
pumping lemma for regular languages, minimization of finite automata.
[8hrs] (CO2)
Module3: Context-free languages and pushdown automata:
Context-free grammars (CFG) and languages (CFL), Chomsky and Greibach normal forms,
nondeterministic pushdown automata (PDA) and equivalence with CFG, parse trees, ambiguity
in CFG, pumping lemma for context-free languages, deterministic pushdown automata, closure
properties ofCFLs.
[8hrs] (CO3)
Module 4: Context-sensitive languages:
Context-sensitive grammars (CSG) and languages, linear bounded automata and equivalence
with CSG.
[5hrs] (CO4)
Module 5: Turing machines:
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.
[8hrs] (CO 5)
Module 6: Undecidability & Intractablity:
Church-Turing thesis, universal Turing machine, the universal and diagonalization languages,
reduction between languages and Rice s theorem, un-decidable problems about languages.
Intractablity: Notion of tractability/feasibility. The classes NP and co-NP, their importance.
Polynomial time many-one reduction. Completeness under this reduction. Cook-Levin
theorem: NP-completeness of propositional satisfiability, other variants of satisfiability. NP-
complete problems from other domains: graphs (clique, vertex cover, independent sets,
Hamiltonian cycle), number problem (partition),setcover
[12hrs] (CO5 )

You might also like