0 votes
0 votes

in Theory of Computation
142 views

2 Answers

1 vote
1 vote
Regular Expression  (0+1)*

The given epsilon-NFA will accept every string generated from 0 & 1.
1 vote
1 vote

Step1: Convert the NFA with null moves to NFA without null moves

Step2: Convert that NFA to DFA

Step3: You can get the regular expression from the DFA by using Arden's theorm.

The Regular expression will be 0(0+1)(0+1)*

Related questions