3,056 views
1 votes
1 votes

Convert the given Finite Automata to Regular Expression.

2 Answers

2 votes
2 votes

Pardon for handwriting .. Hope this helps :)

0 votes
0 votes
First of all it is not DFA

In every state for every input alphabet transition is not defined

Related questions

2 votes
2 votes
2 answers
1
1 votes
1 votes
1 answer
2
Parshu gate asked Aug 5, 2017
969 views
Can I write the 1st one as 2nd one ? are both equivalent ? If yes then why cant we use the 2nd ? The 1st is given as a standard in many notes which looks more complicat...