0 votes 0 votes if L1 = {anbn| n>=0} is not regular then how come L2 = {an|n>=0} is regular? Theory of Computation theory-of-computation regular-language finite-automata + – Mk Utkarsh asked Nov 23, 2017 Mk Utkarsh 516 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 0 votes 0 votes becz in case of L1 = {anbn| n>=0 } we need to do infinite number of comparision which is not the job of automata. but in case of L2 = {an|n>=0} it is just like any number of a so we can design dfa for it....hence regular eyeamgj answered Nov 23, 2017 selected Nov 23, 2017 by Mk Utkarsh eyeamgj comment Share Follow See 1 comment See all 1 1 comment reply Mk Utkarsh commented Nov 23, 2017 reply Follow Share oh yeah this is stupid question :| thanks 1 votes 1 votes Please log in or register to add a comment.