Scribd
Upload
82 views1 page

Discipline Specific Core Course (LOCF) : BHCS 12 - Theory of Computation

This document outlines the topics and schedule for a 12-week course on Theory of Computation. The course covers the following topics: 1. Languages, strings, regular expressions, and finite automata. 2. Properties of regular languages and the relationship between regular languages and finite automata. 3. Context-free grammars, parse trees, pushdown automata, and pumping lemmas. 4. Turing machines, configurations, computations, and the Church-Turing thesis. The course allocates approximately 12 hours to regular languages and finite automata, 15 hours to regular languages, 10 hours to non-regular languages and context-free grammars, 10 hours to context-free

Uploaded by

soft ware
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
82 views1 page

Discipline Specific Core Course (LOCF) : BHCS 12 - Theory of Computation

This document outlines the topics and schedule for a 12-week course on Theory of Computation. The course covers the following topics: 1. Languages, strings, regular expressions, and finite automata. 2. Properties of regular languages and the relationship between regular languages and finite automata. 3. Context-free grammars, parse trees, pushdown automata, and pumping lemmas. 4. Turing machines, configurations, computations, and the Church-Turing thesis. The course allocates approximately 12 hours to regular languages and finite automata, 15 hours to regular languages, 10 hours to non-regular languages and context-free grammars, 10 hours to context-free

Uploaded by

soft ware
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

Date: 10/07/2021

BHCS 12 - Theory of Computation


Discipline specific core course (LOCF)
Unit Topic Chapter Reference Total
Hours
Languages: Alphabets, String, Language, Basic operations on
1. language, Concatenation, Union, Kleene Star 2 (1J
Regular Languages and Finite Automata:
2. a) Regular expressions 4 [1] 12
b) Deterministic finite automata (DFA) S (1j
Regular Languages:
a) Non-deterministic finite automata (NFA) 7 (1]
b) Relationship between NFA and DFA 7 [11
c) Transition graphs (TG) 6 [1) 15
3. d) Properties of regular languages 9 (1]
e) The relationship between regular languages and finite 7 [1j
automata (Converting RE into FA and vice-versa)
f) Kleene’s theorem 7 [1]
Non-Regular Languages and Context Free Grammars:
a) Pumping lemma for regular grammars 10 [1)
4. (Excluding Myhill-Nerode theorem & Quotient Languages) 10
b) Context-free grammars (CFG), parse tree 12 (1j
(Excluding Lukasiewicz notation)
Context-Free Languages (CFL) and
Pushdown Automata (PDA):
a) Deterministic and non-deterministic pushdown automata 14 [1)
b) Grammatical Format 13 (1I
5. (Including killing A (null) productions, killing unit 10
productions, Chomsky normal form (CNF), leftmost
derivation) 16 {11
c) Pumping lemma for CFL 17 {11
d) Properties of CFL
(Excluding mixing context-free and regular languages)
Turing Machines and Models of Computations:
a) Simple Turing machine (configuration and computation) 4
(upto I2]
6. 4.2) 8
b) Decidability (Church Turing thesis, universal Turing machine, 5 (upto [2]
halting problem) 5.3)

References
1. Cohen, D. 1. A. (2011). Introduction to Computer Theory. 2’ d edition. Wiley India.
2. Lewis, H.R. & Papadimitriou, H. R. (2002). Elements of the Theory of Computation. 2’ d edition. Prentice Hall of India

(Dr. Neeraj Kumar Sharma) (Mr. Ravi Kumar Yadav) (Mr. Onkar Singh)

You might also like