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

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 (31 points) | 70 views
Your dfa accept baabb

I think ,it should be r.e.

Thank you!
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

35,485 questions
42,741 answers
42,135 users