Scribd
Upload
51 views2 pages

U18Cn404 Theory of Computation: Languages and Computation, 3rd Ed. Hong Kong: Pearson Education Asia, 2007

This document provides information about the Theory of Computation course for the 4th semester B.Tech program in Computer Science and Engineering (Networks). The course aims to develop students' knowledge of formal languages, automata theory, and computability. It covers topics like finite automata, regular expressions, context-free grammars, pushdown automata, and Turing machines. The course has 4 units and aims to help students write formal notations for strings and languages, design context-free grammars, determine language equivalences, and distinguish computability and decidability in Turing machines.

Uploaded by

Mahendar
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
51 views2 pages

U18Cn404 Theory of Computation: Languages and Computation, 3rd Ed. Hong Kong: Pearson Education Asia, 2007

This document provides information about the Theory of Computation course for the 4th semester B.Tech program in Computer Science and Engineering (Networks). The course aims to develop students' knowledge of formal languages, automata theory, and computability. It covers topics like finite automata, regular expressions, context-free grammars, pushdown automata, and Turing machines. The course has 4 units and aims to help students write formal notations for strings and languages, design context-free grammars, determine language equivalences, and distinguish computability and decidability in Turing machines.

Uploaded by

Mahendar
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/ 2

U18CN404 THEORY OF COMPUTATION

Class: B.Tech. IV-Semester Branch: Department of Computer Science and


Engineering (Networks)

Teaching Scheme: Examination Scheme:


L T P C Continuous Internal Evaluation 40 marks
3 - - 3 End Semester Examination 60 marks

Course Learning Objectives (LOs):


This course will develop student’s knowledge in/ion…
LO1: formal notation for strings, languages and finite automata
LO2: properties of regular languages, types of grammars and applications of context free grammar
LO3: equivalence of languages accepted by pushdown automata and languages generated by context free
grammars.
LO4: computability & non-computability and decidability & un-decidability problems in turing machines

UNIT – I (9)
Automata Theory: Introduction to finite automata, Structural representations and the central concepts of
automata theory
Finite Automata: Deterministic finite automata, Non-deterministic finite automata, Finite automata with
epsilon-transitions, Finite automata with output
Regular Expressions and Languages: Regular expressions, Finite automata and regular expressions,
Applications of regular expressions, Regular sets and regular grammars

UNIT – II (9)
Properties of Regular Languages: Proving languages not to be regular, Closure properties of regular
languages, Equivalence and minimization of automata
Context-free Grammars and Languages: Chomsky classification of languages, Context-free grammars, Parse
trees, Applications of context-free grammars, Ambiguity in grammars and languages, Simplification of context-
free grammars

UNIT – III (9)


Properties of Context-free Languages: Normal forms for context-free grammars, Pumping lemma for context-
free languages, Closure properties of context-free languages, Decision properties of context-free languages
Pushdown Automata: Definition of the pushdown automaton, Deterministic pushdown automata, Languages
of pushdown automata, Equivalence of pushdown automata and context- free grammar

UNIT – IV (9)
Introduction to Turing Machines: Problems that computers cannot solve, Turing machine,
Programming techniques for turing machines, Extensions to the basic turing machine
Undecidability: A language that is not recursively enumerable, An undecidable problem that is
recursively enumerable, Undecidable problems about turing machines, Posts correspondence problem, Classes
P & NP, NP-complete problem

Text Book:
John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman, Introduction to Automata Theory,
Languages and Computation, 3rd ed. Hong Kong: Pearson Education Asia, 2007.

KITSW-Syllabi for III to VIII Semester B. Tech. CSN 4 – year Degree Page 48 of 196
Programme 67
Reference Books:
[1] Harry R. Lewis and Christos H. Papadimitriou, Elements of the Theory of Computation,
PearsonEducation Asia,2nded.1998.
[2] Michael Sipser, Introduction to the Theory of Computation, PWS Publishing, Books/Cole Thomson
Learning, 2nded. 2001.

[3] John Martin, Introduction to Languages and The Theory of Computation, Tata McGraw-HillEducation
Pvt. Ltd., 3rd ed.2007.

[4] Dexter C. Kozen, Automata and Computability, Undergraduate Texts in Computer Science,
Springer,1997.

Course Learning Outcomes (COs):


On completion of this course, students will be able to…
CO1: write a formal notation for strings, languages and Finite Automata.
CO2: design context free grammars to generate strings of context free language
CO3: determine equivalence of languages accepted by pushdown automata and languages generated by
context free grammars
CO4: distinguish between computability & non-computability and decidability & un-decidability in turing
machines

Course Articulation Matrix (CAM): U18IT404 THEORY OF COMPUTATION


PS
PO PO PO PO PO PO PO PO PO PO PSO PSO
Course Outcomes PO2 PO4 O
1 3 5 6 7 8 9 10 11 12 1 2 3
U18IT404.1 2 2 2 2 - 1 - - - - - - 2 2 -
CO1
U18IT404.2 2 2 2 - - 1 - - - - - - 2 2 -
CO2
U18IT404.3 2 2 2 2 - 1 - - - - - - 2 2 -
CO3
U18IT404.4 2 2 2 2 - 1 - - - - - 2 2 2 -
CO4
U18IT404 2 2 2 2 - 1 - - - - - 2 2 2 -

KITSW-Syllabi for III to VIII Semester B. Tech. CSN 4 – year Degree Page 48 of 196
Programme 67

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