Register

Regular expression for given FA

3,380 views
1 1 vote

6 Answers

0 0 votes
It looks something like..

b(bb)* + (a + b(bb)*a + b(bb*)ba).(b + abba + aa)*

I maybe wrong, if so please tell me.
0 0 votes
>>>>

i made a silly  mistake....thanks @joshi_nitish

(ab*a + bb + bab*a)*(ab* + b + bab*)
• edited by
Voting & Accepting an answer helps improve the community
← Previous · With quick sort The ...Next → · C PROGRAMMING
← Previous in category · theory of computatio...Next in category → · theory of computatio...
Position:
Show:

Related questions

2 2 votes
2 2 answers
1.2k
1.2k views
Tuhin Dutta asked Dec 4, 2017
1,205 views
Regular expression for single state FA without final state
Give the language and Regular Expression for this finite automaton.Is it a DFA or NFA? Can we draw a DFA without a single final state?
1 1 vote
2 answers 2 answers
2.1k
2.1k views
shekhar chauhan asked Apr 21, 2016
2,114 views
What language does this FA represent ? And what is the regular expression for this FA ?
0 0 votes
1 answers 1 answer
1.1k
1.1k views
sripo asked Oct 10, 2018
1,109 views
Automata for given Regular Expression
Can you please draw the DFA for given regex (ab*)*
0 0 votes
0 0 answers
10.0k
10.0k views
surbhijain93 asked May 9, 2018
10,033 views
FA to Regular Expression: when no two a's and no two b's should come together
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 atta...