in Theory of Computation
978 views
0 votes
0 votes

Which of the regular expressions given below represent the following DFA?

A) 0*1(1+00*1)*

B) 0*1*1+11*0*1

C) (0+1)*1

in Theory of Computation
by
978 views

1 comment

answer is A and C

but I'm getting this using state elimination method. pls tell where I am going wrong?

correction-in the 2nd approach the expression will be (0+11*0)*

0
0

1 Answer

0 votes
0 votes

@aditi19 This is the solution of your question.

3 Comments

I don't understand this. pls show in detailed steps
0
0

are you implying this?

1
1
Yes,this is what i am implying
0
0

Related questions