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)
18 videos|69 docs|44 tests

Top Courses for Computer Science Engineering (CSE)

18 videos|69 docs|44 tests
Download as PDF
Explore Courses for Computer Science Engineering (CSE) exam

Top Courses for Computer Science Engineering (CSE)

Signup for Free!
Signup to see your scores go up within 7 days! Learn & Practice with 1000+ FREE Notes, Videos & Tests.
10M+ students study on EduRev
Related Searches

shortcuts and tricks

,

Important questions

,

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

,

study material

,

practice quizzes

,

Summary

,

Free

,

MCQs

,

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

,

Viva Questions

,

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

,

Extra Questions

,

Objective type Questions

,

Previous Year Questions with Solutions

,

video lectures

,

Exam

,

ppt

,

Sample Paper

,

Semester Notes

,

pdf

,

past year papers

,

mock tests for examination

;