Scribd
Upload
20 views

TCS Lect 1 Syllabus - Intro

TCS Lect 1 Syllabus _ Intro

Uploaded by

nishitwadhwani2902
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
20 views

TCS Lect 1 Syllabus - Intro

TCS Lect 1 Syllabus _ Intro

Uploaded by

nishitwadhwani2902
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 24

Theory of Computer

Science
T E C OM P UT E R
L E C T UR E 1

Prepared By: Mr. Vaibhav


Content

• Syllabus

• Assessment

• Textbook and References

Prepared By: Mr. Vaibhav


Theory of computer science

• Course Code: CSC 501

• Number of Credits: 4

• Prerequisite: Discrete Structures

Prepared By: Mr. Vaibhav


Course objectives

1. Acquire conceptual understanding of fundamentals of


grammars and languages.

2. Build concepts of theoretical design of deterministic and


non-deterministic finite automata and push down automata.

3. Develop understanding of different types of Turing machines


and applications.

4. Understand the concept of Undecidability.


Prepared By: Mr. Vaibhav
Course Outcomes

1. Understand concepts of Theoretical Computer Science, difference and


equivalence of DFA and NFA , languages described by finite automata
and regular expressions

2. Design Context free grammar, pushdown automata to recognize the


language.

3. Develop an understanding of computation through Turing Machine.

4. Acquire fundamental understanding of decidability and undecidability

Prepared By: Mr. Vaibhav


• Module 1.1

Basic  Importance of TCS

concepts and  Alphabets, Strings, Languages, Closure

finite properties.

automata  Finite Automata (FA) and Finite State


Module 1 machine (FSM).

Prepared By: Mr. Vaibhav


• Module 1.2
 Deterministic Finite Automata (DFA) and
Nondeterministic Finite Automata (NFA):
Definitions, transition diagrams and Language
Basic recognizers
concepts and ü Equivalence between NFA with and without
finite ε- transitions
automata  NFA to DFA Conversion
Module 1
 Minimization of DFA

 FSM with output: Moore and Mealy machines

 Applications and limitations of FA


Prepared By: Mr. Vaibhav
• Module 2.1
 Regular Expression (RE)

 Equivalence of RE and FA, Arden‘s Theorem


Regular  RE Applications
Expression
and • Module 2.2
languages  Regular Language (RL)
Module 2
 Closure properties of RLs

 Decision properties of RLs

 Pumping lemma for RLs


Prepared By: Mr. Vaibhav
• Module 3.1
 Grammar and Chomsky Hierarchy

• Module 3.2
 Regular Grammar
Grammars  Equivalence of Left and Right linear
Module 3 grammar,

 Equivalence of RG and FA.

Prepared By: Mr. Vaibhav


• Module 3.3 (Context Free Grammar)
 Definition, Sentential forms, Leftmost and
Rightmost derivations, Parse tree,
Ambiguity.

 Simplification and Applications.


Grammars  Normal Forms: Chomsky Normal Forms
Module 3
(CNF) and Greibach Normal Forms (GNF).

 CFLs - Pumping lemma, Closure properties

Prepared By: Mr. Vaibhav


• Definition, Language of PDA

• PDA as generator, decider and


acceptor of CFG.
Push Down
• Deterministic PDA , Non-Deterministic
Automata
PDA
Module 4

• Application of PDA.

Prepared By: Mr. Vaibhav


• Definition

• Design of TM as generator, decider and


acceptor.

• Variants of TM: Multitrack, Multitape


Turing • Universal TM.
Machine
Module 5 • Equivalence of Single and Multi Tape TMs.

• Applications, Power and Limitations of


TMs.

Prepared By: Mr. Vaibhav


• Decidability and Undecidability

• Recursive and Recursively Enumerable


Languages.

• Halting Problem
Undecidability
Module 6 • Rice‘s Theorem

• Post Correspondence Problem

Prepared By: Mr. Vaibhav


Textbooks
1. John E. Hopcroft, Rajeev Motwani, Jeffery D. Ullman, ―
Introduction to Automata Theory, Languages and
Computation, Pearson Education.

2. Michael Sipser, ― Theory of Computation, Cengage


learning.

3. Vivek Kulkarni, ― Theory of Computation, Oxford


University Press, India.

Prepared By: Mr. Vaibhav


References
1. J. C. Martin, ― Introduction to Languages and the
Theory of Computation, Tata McGraw Hill.

2. Kavi Mahesh, ― Theory of Computation: A Problem


Solving Approach, Wiley-India.

Prepared By: Mr. Vaibhav


Assessment
• Internal Assessment (20 Marks)

 Two Class Tests of 20 Marks Each

 Average score will be calculated

• Term work (25 Marks)

 At least 6 Assignments (One Assignment per module)

 Best of 5 Assignments – 20 Marks

 Attendance – 5 Marks

• End Semester Examination (80 Marks)

v Question No 1 is Compulsory – Entire Syllabus – 20 Marks

v From Question 2 to 6 attempt any THREE Questions – Each Question of 20 Marks


Prepared By: Mr. Vaibhav
Useful links

1. www.jflap.org

2. https://nptel.ac.in/courses/106/104/106104028/

3. https://nptel.ac.in/courses/106/104/106104148

Prepared By: Mr. Vaibhav


Introduction

• The Theory of Computation includes


What Can be
Automata Theory done by
Computers
Formal Languages and Grammar in Practice

Computability

Complexity What can be done in


practice

Prepared By: Mr. Vaibhav


Introduction

• The Theory of Computation includes


What Can be
Automata Theory done by
Computers
Formal Languages and Grammar in Practice

Computability

Complexity What can be done in


practice

• Above topics are theoretical foundation of Computer


Science
Prepared By: Mr. Vaibhav
Why To Study Theory ???

1. Provides CONCEPTS and PRINCIPLES


To understand general nature of discipline

Common Underlying Principles for wide variety of Application

2. Ideas have some immediate and important application


E.g. Digital Design, Programming Languages, Compilers

3. Provides many challenges, Puzzle like problems

Prepared By: Mr. Vaibhav


INPUT What is Automaton

• Abstract model of Digital


Computer
Temporary Automaton
Storage

• It can make DECISION in


transition from input to output

OUTPUT

Prepared By: Mr. Vaibhav


Formal Language
• Abstraction of general characteristics of programming
languages

• Set of all sentences permitted by rules of formation


known as Formal Language
 Set of Symbols – Alphabets

 Grouping of symbols with specified rules – Single Sentence

 Rules are known as Grammar

Prepared By: Mr. Vaibhav


QUESTIONS...
???

Prepared By: Mr. Vaibhav


Thank
You....

Prepared By: Mr. Vaibhav

You might also like