Scribd
Upload
28 views2 pages

Toc Syllabus

The BCA-601T course on Theory of Computation aims to teach students about formal language classes and their relationships, focusing on automata theory and computation models. Key outcomes include understanding automata, designing grammars, and classifying problems within different computational models. The course covers topics such as finite automata, regular expressions, context-free grammars, and Turing machines over a total of 52 hours.

Uploaded by

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

Toc Syllabus

The BCA-601T course on Theory of Computation aims to teach students about formal language classes and their relationships, focusing on automata theory and computation models. Key outcomes include understanding automata, designing grammars, and classifying problems within different computational models. The course covers topics such as finite automata, regular expressions, context-free grammars, and Turing machines over a total of 52 hours.

Uploaded by

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

BCA-601T: THEORY OF COMPUTATION

Objective: Identify different formal language classes and their


relationships.

Skills to be developed: To develop methods to describe and analyze the


dynamic behavior of discrete systems.

Course Outcomes:

1. The student will be able to :

2. Acquire fundamental understanding of the core concepts in automata


theory and Theory of Computation

3. Learn how to translate between different models of Computation (e.g.,


Deterministic and Non-deterministic and Software models).

4. Design Grammars and Automata (recognizers) for different language


classes and become knowledgeable about restricted models of
Computation (Regular, Context Free) and their relative powers.

5. Develop skills in formal reasoning and reduction of a problem to a


formal model, with an emphasis on semantic precision and
conciseness.

6. Classify a problem with respect to different models of Computation.

Total Credits Hours/ Internal Exam Total


Number Week Marks
Assessme
Of nt Marks

Hours

52 3 4 40 60 100

Unit – I

Introduction to Finite Automata: The central concepts of Automata


theory; Deterministic finite automata; Nondeterministic finite automata. An
application of finite automata, Finite automata with Epsilon transitions.
[13 Hours]
Unit – II

Regular Expressions: Finite Automata and Regular Expressions


Applications of Regular Expressions. Regular languages; Proving languages
not to be regular languages; Closure properties of regular languages;
Decision properties of regular languages; Equivalence and minimization of
automata. [13 Hours]

Unit – III

Context–free grammars: Chomsky hierarchy Grammer from finite


automata and regular expression, Parse trees; Applications; Ambiguity in
grammars and Languages. Definition of the Pushdown automata; the
languages of a PDA; Equivalence of PDA’s and CFG’s.
Deterministic Pushdown Automata: Normal forms for CFGs;
The pumping lemma for CFGs; Closure properties of CFLs.
[13 Hours]

Unit –IV

The Turing machine: Programming techniques for Turing Machines.


Undecidability, A Language that is not recursively enumerable; An
Undecidable problem that is RE; Post’s Correspondence problem.

[13 Hours]

Text Book:

1. John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman: Introduction to


Automata Theory, Languages and Computation, 3rd Edition, Pearson
Education, 2011.

You might also like