Answered You can hire a professional tutor to get the answer.
QUESTION
Assuming \varepsilon = { a,c,g,t } and let L be the language of strings consisting of repeated copies of the pairs at, ta,cg, gc .
Assuming = { } and let be the language of strings consisting of repeated copies of the pairs . Construct both a DFSM to accept the language and a regular expression that represents the language.
