Register

FA to Regular Expression: when no two a's and no two b's should come together

10,032 views
0 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.

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · DISCRETE MATHSNext → · Morris Mano-chapter ...
← Previous in category · Grade up topicwise q...Next in category → · Minimal Dfa
Position:
Show:

Related questions

1 1 vote
1 1 answer
3.2k
3.2k views
M_Umair_Khan42900 asked Dec 29, 2022
3,220 views
Write regular expression to denote a language L a) String which begin or end with either 00 or 11. b) The set of all strings, when viewed as binary representation of integers, that are divisible by 2. c) The set of all strings containing 00. d) String not containing the substring 110.
Write regular expression to denote a language La) String which begin or end with either 00 or 11.b) The set of all strings, when viewed as binary representation of intege...
4 4 votes
1 answers 1 answer
6.0k
6.0k views
Aakanchha asked May 22, 2015
6,030 views
Build an FA that accepts the language of all strings of a's and b's such that next-to-last letter is an a
Build an FA that accepts the language of all strings of a's and b's such that next-to-last letter is an $a$.
1 1 vote
2 answers 2 answers
2.1k
2.1k views
shekhar chauhan asked Apr 21, 2016
2,112 views
What language does this FA represent ? And what is the regular expression for this FA ?
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?