Scribd
Upload
17 views12 pages

Intro Fa1

Uploaded by

Iron Man
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
17 views12 pages

Intro Fa1

Uploaded by

Iron Man
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/ 12

Theory of Computation

Swati Jaipurkar,
Assistant Professor,
Department of Computer Science & Engg
MIT, Aurangabad, Maharashtra. INDIA
Overview of lecture 1

▪What is TOC.
▪History of abstract machines
▪Terminologies used in TOC
▪Prerequisite for learning TOC
▪Applications of TOC
Example: On-Off Switch as FA
OVERVIEW OF SYLLABUS
1. Finite Automata and Regular Expressions
2. Context Free Grammars
3. Context Free Languages
4. Pushdown Automata
5. Turing Machines and Undecidability
Books
T1. Hopcroft, Ullman, Motwani, Introduction to Automata Theory, Languages,
and Computation, Addison Wesley Publication, 2nd Edition, 2001.

T2. Daniel I. A. Cohen, Introduction to Computer Theory, Wiley Publication,


1st Edition, 1986.

R1. John C. Martin, Introduction to Languages and Theory of Computation,


McGrawHill Publication, 4th Edition, 2010.
R2. K L P Mishra, N. Chandrasekaran, Theory of Computer Science Automata,
Languages & computation, PHI, 3rd Edition, 2009.
Unit 1
1. Finite Automata
2. Deterministic and Non Deterministic FA
3. Mealy and Moore machines
4. Regular expressions, Recursive definition
5. Inter-conversion between NFA and DFA
6. Regular expression and FA
Finite Automata
1. Introduction
2. Definition
3. Acceptance by DFA
Automata

▪ "Automata" is defined as a system where energy, materials and


information are transformed, transmitted and used for performing some
function without direct participation of man.

Fig. 1 Model of Discrete Automata


Characteristics of Automata

▪ Input: Finite no. of fixed values from input alphabet ∑.


▪ Output: Finite no. of fixed values from output O.
▪ States: At any time of instance the automata can be in any
one of the given states q1,q2,…..
▪ State Relation: Next state of automata determined by
present state and present input.
▪ Output relation: o/p is related to either state only or the
input and the state.
Components of Automaton

▪ Input file : Contains strings of input symbols


▪ Storage unit: consists of an unlimited number of cells, each capable of
holding a single symbol from an alphabet
▪ Control unit : can be in any one of a finite number of internal states and
can change states in defined manner
Block Diagram of FA

String to be processed

Input Tape ¢ 0 1 0 1 1 1 0 0 $

Read Head

Finite
Control
Formal Definition of FA

▪ A FA can be represented by a 5-tuple (Q , ∑ , δ , q0 , F) where −


▪ Q : {q0, q1, q2, …} is a finite nonempty set of states.
▪ ∑ : {a, b, …} ,is a finite nonempty set of symbols called the
alphabet.
▪ δ is the transition function which maps Q × ∑ into Q
▪ q0 is the initial state from where any input is processed (q0 ∈ Q).
▪ F is a set of final state/states of Q (F ⊆ Q).

You might also like