1 votes 1 votes L = {a^nb^m : n >= m+3} below context grammer is correct?? S ==> aA | Aa A ==> aAb | bAa | abA | baA | aa Theory of Computation theory-of-computation context-free-grammar + – akhileshreddy asked Jul 12, 2017 • reshown Jul 12, 2017 by akhileshreddy akhileshreddy 568 views answer comment Share Follow See 1 comment See all 1 1 comment reply akhileshreddy commented Jul 12, 2017 reply Follow Share are there any algorithms / techniques for determining best possible context-free grammers? please let me know 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes Your grammar is not correct as we are able to generate "aabaa". CFG can be :- A -> aAb / aaaC C -> aC / epsilon. Xylene answered Jul 12, 2017 • edited Jul 12, 2017 by Xylene Xylene comment Share Follow See all 10 Comments See all 10 10 Comments reply Show 7 previous comments joshi_nitish commented Jul 12, 2017 reply Follow Share @akhilesh, but once the run of a's are finished and b's start...'a' cant start again...or simply we can say a can not come after b... 0 votes 0 votes joshi_nitish commented Jul 12, 2017 reply Follow Share yeah...its perfect now.. 0 votes 0 votes akhileshreddy commented Jul 12, 2017 reply Follow Share thanks for the help 0 votes 0 votes Please log in or register to add a comment.
