717 views

1 Answer

1 votes
1 votes

Strings in the language will be
eps, a, b, ab,ba,bb,aba,bba,abb, bbbb,abbb,abab,abba...

First make DFA, and then convert into regular expression:

=$(b + ab)^{*}(eps+a) $

edited

Related questions

0 votes
0 votes
1 answer
1
gateexplore asked Jun 11, 2023
411 views
Construct an NFA that will accept string of 0's, 1's and 2's beginning with a 0's followed by an odd number of 1's and ending with any number of 2's. Please give the answ...
0 votes
0 votes
1 answer
2
Lakshman Bhaiya asked Dec 27, 2018
543 views
Construct a minimal DFA which accepts set of all strings over {a,b}, such that$1)$Second symbol from $RHS$ should be $‘a’$$2)$Third symbol from $RHS$ should be $‘a�...
1 votes
1 votes
0 answers
3
Tuhin Dutta asked Dec 4, 2017
415 views
why $bb^*$ is $b^*$ and not $b^+$?Ref:$a^*(bb^*a + a)a^*\\=a^*(bb^*+\epsilon)aa^*\\=a^*b^*aa^*\\=a^*b^*a^*a$
6 votes
6 votes
3 answers
4
iarnav asked Aug 11, 2017
3,277 views
I'm so confused what happens when you concatenate/MUL Epsilon ε with any input symbol?What is ε.a = ?and what is ε.0 = ?what is ε.1= ?