• edited by
1,036 views
0 0 votes

The correct regular expression for the below mentioned Finite Automata

 

Do we have to have ca* as C is dead state,does dead state be a part of regular expression?

The expression I am gettting is c*a(d*+ba*) as C state is dead state hence no need to consider it.Please Correct me.

Please log in or register to answer this question.

Position:
Show:

Related questions

1 1 vote
6 6 answers
3.5k
3.5k views
0 0 votes
1 answers 1 answer
1.1k
1.1k views
sripo asked Oct 10, 2018
1,143 views
Can you please draw the DFA for given regex (ab*)*
0 0 votes
1 1 answer
1.6k
1.6k views
Ashish Roy 1 asked Jul 15, 2018
1,583 views
Let L(r1)=(b*ab*ab*ab*)* & L(r2)=(b*ab*ab*)*. What is L(r1) Intersection L(r2)?a) (b*ab*ab*ab*)*b) (b*ab*ab*)*c) (b*ab*ab*)^6d) (b*ab*ab*ab*ab*ab*ab*)*Please do explain a...
0 0 votes
0 0 answers
289
289 views
Ashish Roy 1 asked Jul 15, 2018
289 views
Let r1=(b*ab*ab*ab*)* , r2=(b*ab*ab*)*. What is L(r1) intersection L(r2)?a) (b*ab*ab*ab*)*b) (b*ab*ab*)*c) (b*ab*ab*)^6d) (b*ab*ab*ab*ab*ab*ab*)*