0 votes 0 votes Consider the following grammar G. Is this regular? S →EF E → a|∈ F → abF|ac Theory of Computation finite-automata regular-language regular-grammar + – Piyush Agarwal 1 asked Nov 3, 2018 • retagged Nov 18, 2018 by go_editor Piyush Agarwal 1 237 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes Regular -----> (a+∈)(ab)*ac tech_beardo answered Jul 26, 2020 tech_beardo comment Share Follow See all 0 reply Please log in or register to add a comment.