Register

#Convert the NFA in to equivalent R.E.

242 views

2 Answers

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

The given epsilon-NFA will accept every string generated from 0 & 1.
User Avatar
1 votes
1 votes

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)*

User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

2.6k
views
2 answers
1 votes
ashishgateashish asked Feb 27, 2018
2,580 views
NFA-E to DFA conversion. (which is the correct solution?)
1. Which solution is correct? (or both wrong!)2. Does every 'DFA equivalent' of any NFA has same starting state? if not, please give any smallest example.
User Avatar
636
views
0 answers
0 votes
Subhrangsu asked May 28, 2022
636 views
Construct equivalent DFA transaction table for the following NFA.
Construct equivalent DFA transaction table for the following NFA.
User Avatar
4.5k
views
5 answers
14 votes
Vikrant Singh asked Feb 1, 2015
4,516 views
No. of states in the minimal finite automata which accepts the binary strings whose equivalent is divisible by 32 is ________?
No. of states in the minimal finite automata which accepts the binary strings whose equivalent is divisible by 32 is ________?A. 5B. 6C 31D 32
User Avatar
1.5k
views
4 answers
2 votes
iarnav asked Aug 20, 2017
1,470 views
#TOC what will be the R.E of this DFA?
I'm getting R.E as 0*1(01)*1(0+1)* but people are getting (0+10)*11(1+0)*Please tell, how!?
User Avatar
Link Copied!