The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
112 views

I wanted to covert the finite automata of the question 'when no two a's and no two b's should come together' to regular expression. But I am not able to do so.

I have attached my working. Kindly see it and please tell where I am wrong. Also, I am not able to eliminate state B (and not eliminating step C) or vice-versa and draw it as a FA. Please also show the diagram if I eliminate B after eliminating C.

asked in Theory of Computation by (69 points) | 112 views
0
Your dfa accept baabb
+1

I think ,it should be r.e.

0
Thank you!
0
Your welcome!!!

Please log in or register to answer this question.



Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

38,094 questions
45,587 answers
132,148 comments
49,118 users