1 votes 1 votes If the language accepted by a machine is $\{\epsilon,ab,abab,ababab,\ldots\}$ then this language can be represented as: a) $L(M)= \{(ab)^{n}$ ,n $\geq 0\}$ or b) $L(M)= \{(ab)^{*}\}$ Which option is correct? shraddha priya asked Jan 31, 2018 edited Jan 31, 2018 by shraddha priya shraddha priya 354 views answer comment Share Follow See all 6 Comments See all 6 6 Comments reply Show 3 previous comments sumit goyal 1 commented Jan 31, 2018 reply Follow Share Both a , b are same , and correct too 2 votes 2 votes shraddha priya commented Jan 31, 2018 reply Follow Share So when we say n in the 1st option, it means for any/all n >= 0, right? 0 votes 0 votes sumit goyal 1 commented Jan 31, 2018 reply Follow Share yes ..... 1 votes 1 votes Please log in or register to add a comment.