State elimination algorithm example, Exercises of Theory of Automata

it is detailed example of one of the most important topic i.e state elimination algo

Typology: Exercises

2021/2022

Available from 08/16/2022

SamenKhan
SamenKhan 🇵🇰

231 documents

1 / 11

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
State Elimination
Algorithm
Example with epsilon-
NFA
pf3
pf4
pf5
pf8
pf9
pfa

Partial preview of the text

Download State elimination algorithm example and more Exercises Theory of Automata in PDF only on Docsity!

State Elimination

Algorithm

Example with epsilon-

NFA

Generate the R.E of following

epsilon-NFA using state

elimination algorithm.

Step 2: There must be exactly one final state.

Step 3: The final state must not have any outgoing edge.

Step 4: Eliminate all intermediate states one by one in any order.

Step 4: Eliminate all intermediate states one by one in any order.

Step 4: Eliminate all intermediate states one by one in any order.

Step-5: Continue the elimination process of intermediate states until only start state going to final state will be left Step-6: The cost of this transition will be the required regular expression