Question

1. Construct a DFSM to accept the language: L = {w € {a,b}*: w contains at least 3 a's and no more than 3 b's} 2. Let acgt} and let L be the language of strings consisting of repeated copies of the pairs at, ta, cg, gc. Construct both a DFSM to accept the language and a regular expression that represents the language 3. Let a,b. For a string w E ', let W denote the string w with the a's and b's flipped. For example, for w = aabbab: W bbaaba wR babbaa abaabb Construct a PDA to accept the language: L {wwR}. 4. Let E a,b,c,d}. Construct a PDA to accept the language: L%3D {a"b"cРа":т +п3Dр+q} 5. Write down a context-free grammar for the language: L = {a'b/: 2i 3j+1}

Answer 1

Ancue Ha e lake the ioi bal t state oo, chene Le Sae no a and one bgoes to state b and lo0king then looking One o State a state ab and looting Joel b s om stato a leokin one gpesto aa one a made 6, it goes to hap ho biral State any bay Simihnily all othen tanbions Le Sec molc And abter loolcin Ib's ib Lon 't Come state som shee it

bbb ЬН 00 a a a bbb Yabb ab aab >laqbb Arapstate aa a a agabb Oca acab a