0 votes 0 votes Is the language $L(G)=$ {$ab(bbaa)^nbba(ba)^n:n\geq0$} regular? Theory of Computation peter-linz peter-linz-edition4 theory-of-computation regular-language + – Naveen Kumar 3 asked Apr 13, 2019 Naveen Kumar 3 129 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.