1 votes 1 votes The number of unique strings in L((a+b)* a(b+ba)* ) of length less than four is _____ Theory of Computation theory-of-computation regular-expression + – AnilGoudar asked Jul 1, 2017 AnilGoudar 422 views answer comment Share Follow See 1 comment See all 1 1 comment reply joshi_nitish commented Jul 2, 2017 reply Follow Share 11 ??? 0 votes 0 votes Please log in or register to add a comment.
1 votes 1 votes L= 0 => 0(No string possible) L=1 => 1 {a} L=2 => 3 {aa, ba, ab} L=3 => 7 {aaa, aba, baa, bba, bab, aab, abb} Therefore total =0+1+3+7=11 aarsy answered Jul 2, 2017 aarsy comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes 0 length 0 1 length =1 a 2 length = 3 aa,ba,ab 3 length = 7 aaa,aba,baa,aab,aba,bab total 11 Tesla! answered Jul 2, 2017 • edited Sep 16, 2017 by Tesla! Tesla! comment Share Follow See all 2 Comments See all 2 2 Comments reply Udit Gupta 1 commented Sep 16, 2017 reply Follow Share Bro, you cannot generate length 0 strings from this language as minimum 1 'a' has to be there. 1 votes 1 votes Tesla! commented Sep 16, 2017 reply Follow Share Thanks 0 votes 0 votes Please log in or register to add a comment.