Regular Expression to Epsilon NFA | Theory of Computation - Computer Science Engineering (CSE) PDF Download

Introduction

  • ∈-NFA is similar to the NFA but have minor difference by epsilon move. This automaton replaces the transition function with the one that allows the empty string ∈ as a possible input. The transitions without consuming an input symbol are called ∈-transitions.
  • In the state diagrams, they are usually labeled with the Greek letter ∈. ∈-transitions provide a convenient way of modeling the systems whose current states are not precisely known: i.e., if we are modeling a system and it is not clear whether the current state (after processing some input string) should be q or q’, then we can add an ∈-transition between these two states, thus putting the automaton in both states simultaneously.

Common regular expression used in make ∈-NFA
Regular Expression to Epsilon NFA | Theory of Computation - Computer Science Engineering (CSE)

Example: Create a ∈-NFA for regular expression: (a/b)*a

Regular Expression to Epsilon NFA | Theory of Computation - Computer Science Engineering (CSE)

The document Regular Expression to Epsilon NFA | Theory of Computation - Computer Science Engineering (CSE) is a part of the Computer Science Engineering (CSE) Course Theory of Computation.
All you need of Computer Science Engineering (CSE) at this link: Computer Science Engineering (CSE)
Are you preparing for Computer Science Engineering (CSE) Exam? Then you should check out the best video lectures, notes, free mock test series, crash course and much more provided by EduRev. You also get your detailed analysis and report cards along with 24x7 doubt solving for you to excel in Computer Science Engineering (CSE) exam. So join EduRev now and revolutionise the way you learn!
Sign up for Free Download App for Free
18 videos|70 docs|44 tests

Up next

18 videos|70 docs|44 tests
Download as PDF

Up next

Explore Courses for Computer Science Engineering (CSE) exam
Related Searches

Previous Year Questions with Solutions

,

mock tests for examination

,

Sample Paper

,

Regular Expression to Epsilon NFA | Theory of Computation - Computer Science Engineering (CSE)

,

video lectures

,

practice quizzes

,

Regular Expression to Epsilon NFA | Theory of Computation - Computer Science Engineering (CSE)

,

pdf

,

Viva Questions

,

Regular Expression to Epsilon NFA | Theory of Computation - Computer Science Engineering (CSE)

,

MCQs

,

Semester Notes

,

Objective type Questions

,

Exam

,

Important questions

,

ppt

,

Summary

,

past year papers

,

study material

,

shortcuts and tricks

,

Extra Questions

,

Free

;