1 votes 1 votes Find all strings in $L((a + b) b (a + ab)^*)$ of length less than four. Theory of Computation peter-linz peter-linz-edition4 theory-of-computation regular-expression + – Naveen Kumar 3 asked Mar 31, 2019 Naveen Kumar 3 712 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes ab,bb,aba,bba. tusharp answered Apr 1, 2019 tusharp comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes $L=((a+b)b(a+ab)^*)$ can be written as follows: $L=((ab+bb)(a+ab)^0\cup(a+ab)^1\cup(a+ab)^2)$ $L=(ab+bb)(\epsilon,a,ab,aa,aab,aba,abab)$ $L=ab,aba,bb,bba$ Total $4$ strings will be generated whose lengths is $<4.$ Hira Thakur answered Feb 6, 2023 Hira Thakur comment Share Follow See all 0 reply Please log in or register to add a comment.