1 votes 1 votes Construct a right linear grammar for the language $L((aab^*ab)^*)$ is this grammar correct? S->aaA | ε A->bA | abA | S Theory of Computation theory-of-computation peter-linz peter-linz-edition4 finite-automata regular-language regular-grammar + – aditi19 asked Feb 24, 2019 edited Apr 3, 2019 by Naveen Kumar 3 aditi19 494 views answer comment Share Follow See all 5 Comments See all 5 5 Comments reply Show 2 previous comments Gurdeep Saini commented Feb 24, 2019 reply Follow Share and after change made by @Shaik Masthan . it become valid 0 votes 0 votes aditi19 commented Feb 24, 2019 reply Follow Share got it.. thank u @Gurdeep Saini @Shaik Masthan 0 votes 0 votes Shiva Sagar Rao commented Apr 23, 2021 reply Follow Share https://gateoverflow.in/88391/toc-rlg https://gateoverflow.in/124392/peter-linz-ex 0 votes 0 votes Please log in or register to add a comment.