edited by
354 views
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?
edited by

Please log in or register to answer this question.

Related questions

0 votes
0 votes
0 answers
2
baofbuiafbi asked Nov 14, 2023
151 views
Prove the language L={(G,H)|G is a CFG, H is a DFA, and L(G)∩L(H)=∅} is undecidable.