1 votes 1 votes L = { $a^{i}b^{2i} $ | i>=1} Is this language regular or not ? Is there any specific way to check weather language is regular or not ? Theory of Computation regular-language theory-of-computation + – Nitesh Choudhary asked Jul 5, 2017 edited Jul 5, 2017 by Vijay Thakur Nitesh Choudhary 161 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes Not regular because here we have comparison between no of a and no of b which ca be infinite. But regular language is accepted by finite state machines and finite state machines can't do infinite comparison. jatin saini answered Jul 5, 2017 jatin saini comment Share Follow See all 0 reply Please log in or register to add a comment.