Register

#Convert the NFA in to equivalent R.E.

613 views

2 Answers

1 1 vote
Regular Expression  (0+1)*

The given epsilon-NFA will accept every string generated from 0 & 1.
1 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)*

Voting & Accepting an answer helps improve the community
← Previous · #TOCNext → · #discrete
← Previous in category · CFL and regular lang...Next in category → · #toc
Position:
Show:

Related questions

1 1 vote
2 answers 2 answers
4.1k
4.1k views
ashishgateashish asked Feb 27, 2018
4,097 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.
0 0 votes
0 0 answers
892
892 views
Subhrangsu asked May 28, 2022
892 views
Construct equivalent DFA transaction table for the following NFA.
Construct equivalent DFA transaction table for the following NFA.
15 15 votes
5 answers 5 answers
6.4k
6.4k views
Vikrant Singh asked Feb 1, 2015
6,421 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
2 2 votes
4 answers 4 answers
2.5k
2.5k views
iarnav asked Aug 20, 2017
2,538 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!?