MADHAV INSTITUTE OF TECHNOLOGY

AND SCIENCe

PROFICIENCY:- Introduction to Automata

Department of computer science

SUBMITTED BY : SUBMITTED TO :-
shiva Dr . Manish dixit
BRANCH:- CSD
ENROLL NO:- 0901CD211053
Introduction to
Automata
 What is Automata?
 Automata theory is a branch of computer science that deals with designing abstract
mathematical model for computing real time application.
 An automaton with a finite number of states is called a Finite Automaton. 
 Finite Automata can be represent by 5 – tuples (Q, ∑, δ, q0, F) .
• Q is a finite set of states.
• ∑ is a finite set of symbols, called the alphabet of the automaton.
• δ is the transition function.
• 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).
 Representation of Automata
1.Transiction Diagram 2.Tabular Matrix
 Where vertices=states
 Edges=Transition
Types of Finite Automata
 Deterministic Finite Automaton (DFA)

 In DFA , for a particular i/p character machine goes to one state only.
 Formal Definition of a DFA
 A DFA can be represented by a 5-tuple (Q, ∑, δ, q 0, F) where −
• Q is a finite set of states.
• ∑ is a finite set of symbols called the alphabet.
• δ is the transition function where δ: Q × ∑ → Q
• q0 is the initial state from where any input is processed (q 0 ∈ Q).
• F is a set of final state/states of Q (F ⊆ Q).
Non - Deterministic Finite Automaton (DFA)
 A FA said to be NFA if there is more than one possible state transition from one
state to same I/P symbol.
 Practically can not implement NFA because difficulty in take decision.
Draw a DFA for the language accepting strings
starting with ‘a’ over input alphabets ∑ = {a, b}