1 votes 1 votes Does this grammar generates string of atleast length 2 S->AA A->aA | bA | a | b Theory of Computation grammar + – aditi19 asked Sep 1, 2018 aditi19 452 views answer comment Share Follow See all 6 Comments See all 6 6 Comments reply Show 3 previous comments Deepanshu commented Sep 1, 2018 reply Follow Share @Shaik Masthan I DONT THINK IT IS REGULAR AS TYPE 3 SUPPOSE TO EITHER LEFT LINEAR OR RIGHT LINEAR. S---->AA SUPPOSED TO BE LEFT OR RIGHT BUT WE CANT DECIDE BUT YEPP ACCORDING TO YOUR EXPRESSION SHOWN IT SEEMS TO BE REGULAR BUT IS NOT REGULAR AS S---> AA WE HAVE TO KNOW THIS A FACTOR AND THEN AGAIN COPY. IT IS NON DETERMINSTIC CFL I THINK 0 votes 0 votes sakharam commented Sep 1, 2018 reply Follow Share Yes, This is correct A-> will generate (a+b)+ which means atleast length 1 string S->AA ensures two length string 1 votes 1 votes Shaik Masthan commented Sep 1, 2018 reply Follow Share @Deepanshu if really RE exist ===> it should be Regular. note that many grammars can generate same language, i agree given grammar is not belongs to type-3, but there exist atleast a grammar for this language which is either Left Linear or Right Linear. 3 votes 3 votes Please log in or register to add a comment.