2
Most read
3
Most read
4
Most read
Finite
Automaton
with ε - Moves
-Sampath Kumar S,
AP/CSE, SECE
Finite Automaton with ε - Moves
We extend the class of NFAs by allowing
instantaneous (ε) transitions:
1. The automaton may be allowed to change its state
without reading the input symbol.
2. In diagrams, such transitions are depicted by
labeling the appropriate arcs with ε.
3. Note that this does not mean that ε has become an
input symbol. On the contrary, we assume that the
symbol ε does not belong to any alphabet
11/21/20172
Sampath Kumar S, AP/CSE, SECE
Formal definition of ε-NFA:
A NFA can be represented by a 5-tuples (Q, ∑, δ,
q0, F) where −
 Q is a finite set of states.
 ∑ is a finite set of symbols, called the alphabet of
the automaton.
 δ: Q × Σε → P(Q) 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).
Note: Note ε is never a member of Σ
11/21/20173
Sampath Kumar S, AP/CSE, SECE
ε-Closure:
The ε-Closure is a set of all states which are
reachable from state p on ε-transitions such that:
1. ε-Closure (p) = p where p ∈ Q.
2. If there exist ε-Closure (p) ={q} and δ (q, ε) = r then
ε-Closure (p) = {q, r}
11/21/20174
Sampath Kumar S, AP/CSE, SECE
Example
20. Find the ε-Closure for the following NFA with ε.
11/21/20175
Sampath Kumar S, AP/CSE, SECE
Example
21. Find the ε-Closure for the following NFA with ε.
11/21/20176
Sampath Kumar S, AP/CSE, SECE
11/21/2017
Sampath Kumar S, AP/CSE, SECE
7
நன்றி
11/21/2017
Sampath Kumar S, AP/CSE, SECE
8

More Related Content

PPT
Finite automata
PPT
Discrete Fourier Transform
PPTX
Decomposition methods in DBMS
PPTX
Pushdown Automata Theory
PPTX
NFA & DFA
PDF
Working principle of Turing machine
PPTX
Periodic vs. aperiodic signal
Finite automata
Discrete Fourier Transform
Decomposition methods in DBMS
Pushdown Automata Theory
NFA & DFA
Working principle of Turing machine
Periodic vs. aperiodic signal

What's hot (20)

PPTX
Syntax Analysis in Compiler Design
PPTX
1.8. equivalence of finite automaton and regular expressions
PPTX
Clock driven scheduling
PPTX
3.1,2,3 pushdown automata definition, moves & id
PPTX
Block diagram representation of DT systems
PPTX
Chapter 1 2 - some size factors
PDF
LR(1) CLR(1) Parser with Example
PDF
hazards.pdf
PPTX
First and follow set
PPTX
Functional dependencies and normalization
PPT
Minimization of DFA
PPTX
4.3 techniques for turing machines construction
PPT
Nondeterministic Finite Automata
PPTX
1.3.2 non deterministic finite automaton
PDF
COMPILER DESIGN- Syntax Directed Translation
PPTX
CFG to CNF
PPT
Lecture 8
PPT
Regular expressions-Theory of computation
PPTX
Regular expressions
PPTX
Ripple Carry Adder
Syntax Analysis in Compiler Design
1.8. equivalence of finite automaton and regular expressions
Clock driven scheduling
3.1,2,3 pushdown automata definition, moves & id
Block diagram representation of DT systems
Chapter 1 2 - some size factors
LR(1) CLR(1) Parser with Example
hazards.pdf
First and follow set
Functional dependencies and normalization
Minimization of DFA
4.3 techniques for turing machines construction
Nondeterministic Finite Automata
1.3.2 non deterministic finite automaton
COMPILER DESIGN- Syntax Directed Translation
CFG to CNF
Lecture 8
Regular expressions-Theory of computation
Regular expressions
Ripple Carry Adder
Ad

Similar to 1.4. finite automaton with ε moves (20)

PPTX
Theory of Automata and formal languages unit 1
PPT
1. finite_automata_new.ppt
PPTX
ATFL_MATFL_MMATFL_MMATFL_MMATFL_MMATFL_MMATFL_MMATFL_MMATFL_MMM.pptx
PPTX
automata presentation with added graphics.pptx
PPTX
INTRODUTION Formal Language and Automatic Theory.pptx
PPTX
Automata theory -Conversion of ε nfa to nfa
PPT
NFA or Non deterministic finite automata
PPTX
Chapter-twoChapter-three automata and complexity theory .pptx
PPTX
FINITE AUTOMATA
PDF
Theory of Computation FSM Conversions and Problems
PPTX
TOC Introduction
PPTX
Formal language and automata theoryLAT Class notes.pptx
PPTX
Automata introduction to FA_ Anurag Kumar.pptx
PDF
Finite automata
PDF
5. NFA & DFA.pdf
PPTX
inbound6417574391896884649.pptx
PDF
DOC
AUTOMATA THEORY - SHORT NOTES
PPTX
1.7. eqivalence of nfa and dfa
Theory of Automata and formal languages unit 1
1. finite_automata_new.ppt
ATFL_MATFL_MMATFL_MMATFL_MMATFL_MMATFL_MMATFL_MMATFL_MMATFL_MMM.pptx
automata presentation with added graphics.pptx
INTRODUTION Formal Language and Automatic Theory.pptx
Automata theory -Conversion of ε nfa to nfa
NFA or Non deterministic finite automata
Chapter-twoChapter-three automata and complexity theory .pptx
FINITE AUTOMATA
Theory of Computation FSM Conversions and Problems
TOC Introduction
Formal language and automata theoryLAT Class notes.pptx
Automata introduction to FA_ Anurag Kumar.pptx
Finite automata
5. NFA & DFA.pdf
inbound6417574391896884649.pptx
AUTOMATA THEORY - SHORT NOTES
1.7. eqivalence of nfa and dfa
Ad

More from Sampath Kumar S (20)

PPTX
5.2 primitive recursive functions
PPTX
4.7. chomskian hierarchy of languages
PPTX
4.6 halting problem
PPTX
4.2 variantsof turing machines (types of tm)
PPTX
4.1 turing machines
PPTX
3.6 & 7. pumping lemma for cfl & problems based on pl
PPTX
3.5 equivalence of pushdown automata and cfl
PPTX
3.4 deterministic pda
PPTX
2.8 normal forms gnf & problems
PPTX
2.7 normal forms cnf & problems
PPTX
2.5 ambiguity in context free grammars
PPTX
2.4 derivations and languages
PPTX
2.3 context free grammars and languages
PPTX
2.1 & 2.2 grammar introduction – types of grammar
PPTX
1.10. pumping lemma for regular sets
PPTX
1.9. minimization of dfa
PPTX
1.5 & 1.6 regular languages & regular expression
PPTX
1.3.1 deterministic finite automaton
PPTX
1.2. introduction to automata theory
PPTX
1.1. the central concepts of automata theory
5.2 primitive recursive functions
4.7. chomskian hierarchy of languages
4.6 halting problem
4.2 variantsof turing machines (types of tm)
4.1 turing machines
3.6 & 7. pumping lemma for cfl & problems based on pl
3.5 equivalence of pushdown automata and cfl
3.4 deterministic pda
2.8 normal forms gnf & problems
2.7 normal forms cnf & problems
2.5 ambiguity in context free grammars
2.4 derivations and languages
2.3 context free grammars and languages
2.1 & 2.2 grammar introduction – types of grammar
1.10. pumping lemma for regular sets
1.9. minimization of dfa
1.5 & 1.6 regular languages & regular expression
1.3.1 deterministic finite automaton
1.2. introduction to automata theory
1.1. the central concepts of automata theory

Recently uploaded (20)

PDF
BP 704 T. NOVEL DRUG DELIVERY SYSTEMS (UNIT 1)
PDF
احياء السادس العلمي - الفصل الثالث (التكاثر) منهج متميزين/كلية بغداد/موهوبين
PDF
Empowerment Technology for Senior High School Guide
PDF
1.3 FINAL REVISED K-10 PE and Health CG 2023 Grades 4-10 (1).pdf
DOC
Soft-furnishing-By-Architect-A.F.M.Mohiuddin-Akhand.doc
PDF
Τίμαιος είναι φιλοσοφικός διάλογος του Πλάτωνα
PDF
AI-driven educational solutions for real-life interventions in the Philippine...
PPTX
History, Philosophy and sociology of education (1).pptx
PDF
advance database management system book.pdf
PPTX
B.Sc. DS Unit 2 Software Engineering.pptx
PDF
David L Page_DCI Research Study Journey_how Methodology can inform one's prac...
PPTX
Introduction to pro and eukaryotes and differences.pptx
PDF
LDMMIA Reiki Yoga Finals Review Spring Summer
PPTX
Chinmaya Tiranga Azadi Quiz (Class 7-8 )
PPTX
CHAPTER IV. MAN AND BIOSPHERE AND ITS TOTALITY.pptx
PDF
A GUIDE TO GENETICS FOR UNDERGRADUATE MEDICAL STUDENTS
PDF
ChatGPT for Dummies - Pam Baker Ccesa007.pdf
PPTX
Onco Emergencies - Spinal cord compression Superior vena cava syndrome Febr...
PDF
Hazard Identification & Risk Assessment .pdf
PDF
Complications of Minimal Access-Surgery.pdf
BP 704 T. NOVEL DRUG DELIVERY SYSTEMS (UNIT 1)
احياء السادس العلمي - الفصل الثالث (التكاثر) منهج متميزين/كلية بغداد/موهوبين
Empowerment Technology for Senior High School Guide
1.3 FINAL REVISED K-10 PE and Health CG 2023 Grades 4-10 (1).pdf
Soft-furnishing-By-Architect-A.F.M.Mohiuddin-Akhand.doc
Τίμαιος είναι φιλοσοφικός διάλογος του Πλάτωνα
AI-driven educational solutions for real-life interventions in the Philippine...
History, Philosophy and sociology of education (1).pptx
advance database management system book.pdf
B.Sc. DS Unit 2 Software Engineering.pptx
David L Page_DCI Research Study Journey_how Methodology can inform one's prac...
Introduction to pro and eukaryotes and differences.pptx
LDMMIA Reiki Yoga Finals Review Spring Summer
Chinmaya Tiranga Azadi Quiz (Class 7-8 )
CHAPTER IV. MAN AND BIOSPHERE AND ITS TOTALITY.pptx
A GUIDE TO GENETICS FOR UNDERGRADUATE MEDICAL STUDENTS
ChatGPT for Dummies - Pam Baker Ccesa007.pdf
Onco Emergencies - Spinal cord compression Superior vena cava syndrome Febr...
Hazard Identification & Risk Assessment .pdf
Complications of Minimal Access-Surgery.pdf

1.4. finite automaton with ε moves

  • 1. Finite Automaton with ε - Moves -Sampath Kumar S, AP/CSE, SECE
  • 2. Finite Automaton with ε - Moves We extend the class of NFAs by allowing instantaneous (ε) transitions: 1. The automaton may be allowed to change its state without reading the input symbol. 2. In diagrams, such transitions are depicted by labeling the appropriate arcs with ε. 3. Note that this does not mean that ε has become an input symbol. On the contrary, we assume that the symbol ε does not belong to any alphabet 11/21/20172 Sampath Kumar S, AP/CSE, SECE
  • 3. Formal definition of ε-NFA: A NFA can be represented by a 5-tuples (Q, ∑, δ, q0, F) where −  Q is a finite set of states.  ∑ is a finite set of symbols, called the alphabet of the automaton.  δ: Q × Σε → P(Q) 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). Note: Note ε is never a member of Σ 11/21/20173 Sampath Kumar S, AP/CSE, SECE
  • 4. ε-Closure: The ε-Closure is a set of all states which are reachable from state p on ε-transitions such that: 1. ε-Closure (p) = p where p ∈ Q. 2. If there exist ε-Closure (p) ={q} and δ (q, ε) = r then ε-Closure (p) = {q, r} 11/21/20174 Sampath Kumar S, AP/CSE, SECE
  • 5. Example 20. Find the ε-Closure for the following NFA with ε. 11/21/20175 Sampath Kumar S, AP/CSE, SECE
  • 6. Example 21. Find the ε-Closure for the following NFA with ε. 11/21/20176 Sampath Kumar S, AP/CSE, SECE

Editor's Notes

  • #2: School of EECS, WSU