Computer Science, asked by kssaisasidhar, 6 months ago

Construct a regular expression corresponding to the DFA represented by the below transition

table. q1 is both the initial state and final state.


0 1

q1 q1 q2

q2 q3 q2

q3 q1 q2


PS. 0's and 1's are for column 2 and 3 respectively

Answers

Answered by dewanganvatsal08
0

Answer:

2468101214161820

Explanation:

I do not know about this

Similar questions