Scribd
Upload
6 views2 pages

PGCA1927 Theory of Computation

The document outlines the course PGCA1927, Theory of Computation, for the MCA program, detailing its structure, outcomes, and content. Students will learn about formal languages, automata theory, context-free languages, Turing machines, and computational complexity. The course includes a total of 44 contact hours and utilizes various textbooks and reference materials.

Uploaded by

kavijeet
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
6 views2 pages

PGCA1927 Theory of Computation

The document outlines the course PGCA1927, Theory of Computation, for the MCA program, detailing its structure, outcomes, and content. Students will learn about formal languages, automata theory, context-free languages, Turing machines, and computational complexity. The course includes a total of 44 contact hours and utilizes various textbooks and reference materials.

Uploaded by

kavijeet
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

Course Code: PGCA1927

Course Name: Theory of Computation

Program: MCA L:4 T:0 P:0


Branch: Computer Applications Credits: 4
Semester: III Contact hours: 44 hours
Theory/Practical: Theory Percentage of numerical/design problems:
Internal max. marks: 30 Duration of end semester exam (ESE):
External max. marks:70 Elective status: core/elective Elective-III
Total marks:100

Prerequisite:
Co requisite:
Additional material required in ESE: NO
COURSE OUTCOMES: Students will be able to
CO# Course outcomes
CO1 Use basic concepts of formal languages of finite automata techniques.
CO2 Design Finite Automata for different Regular Expressions and Languages.
CO3 Construct context free grammar for various languages.
CO4 Solve various problems of applying normal form techniques, push down automata and
Turing Machines.
CO5 Solve computational problems regarding their computability and complexity and prove
the basic results of the theory of computation.

Detailed contents Contact


hours
Part A
Formal Language, Non-Computational Problems, Diagonal Argument, Russels’s Paradox.
Theory of Automata: Deterministic Finite Automaton (DFA), Non- Deterministic Finite 22 hours
Automaton (NDFA), Equivalence of DFA and NDFA, Mealy and Moore Models,
Minimization of Finite Automata.
Regular Sets and Regular Grammars: Regular Languages, Regular Grammars, Regular
Expressions, Properties of Regular Language, Pumping Lemma, Non-Regular Languages,
Lexical Analysis.
Context Free Language: Properties of Context Free Language, Chomsky Classification of
Languages, Context Free Grammar, Simplification of Context Free Grammar, Chomsky
Normal Form, Greibach Normal Form.
Part B

Push Down Automata: Ambiguity, Parse Tree Representation of Derivation Trees, 22 hours
Equivalence of PDA’s and Pushdown Automaton (PDA), Non-Deterministic Pushdown
Automaton (NPDA).
Turing Machines (TM): Standard Turing Machine and its Variations; Universal Turing
Machines, Models of Computation and Church Turing Thesis. Recursive and Recursively-
Enumerable Languages; Context Sensitive Languages, Unrestricted Grammars, Chomsky
Hierarchy of Languages, Construction of TM for Simple Problems.
Unsolvable Problems and Computational Complexity: Unsolvable Problem, Halting
Problem, Post Correspondence Problem, Unsolvable Problems for Context-Free
Languages, Measuring and Classifying Complexity, Tractable and Intractable Problems.

Text Books:
1. Jeffrey Ullman and John Hopcroft, Introduction to Automata Theory, Languages, and
Computation, 3e, Pearson Education India (2008).
2. K.L.P. Mishra, Theory of Computer Science: Automata, Languages and Computation, Prentice
Hall India Learning Private Limited (2006).
3. John Martin, Introduction to Languages and the Theory of Computation, McGraw-Hill Higher
Education (2007).

Reference Books:
1. Introduction to Computer Theory, Daniel. I.A. Cohen, John Wiley & Sons.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy