0 votes 0 votes Show that $L=$ {$a^n: n ≥4$} is regular. Theory of Computation peter-linz peter-linz-edition4 theory-of-computation finite-automata + – Naveen Kumar 3 asked Mar 20, 2019 Naveen Kumar 3 387 views answer comment Share Follow See 1 comment See all 1 1 comment reply amanverma== commented Mar 20, 2019 reply Follow Share We can draw the DFA for this or a regular expression and either a LR(left recursive) or RR(right recursive) grammar.For a grammar to be regular , there has to be a loop present in the grammar. Also, if a grammar is both left recursive and right recursive,it cannot be regular. (because it produces ambiguity) DFA: a^n: n ≥4 Regular Expression: aaaa(a$^{*}$) Grammar: A->aaaaB B->aB | $^{\epsilon }$ <= THIS IS RIGHT RECURSIVE GRAMMAR We can also write a left recursive grammar for this A->Baaaa B->Ba | $^{\epsilon }$ <= THIS IS LEFT RECURSIVE GRAMMAR. 1 votes 1 votes Please log in or register to add a comment.
0 votes 0 votes we can draw a dfa for this . so it is regular abhishekmehta4u answered Mar 20, 2019 abhishekmehta4u comment Share Follow See all 0 reply Please log in or register to add a comment.