Do as required for the languages given defined over ={a, b}:- (16)

a) b)

c) d)

Build Finite Automaton for a language L= b*aa*+ (b*a+b+a+).

Build FA accepting Language L= (a+ + a+b+a+) + (b+ + b+a+b+).

Build Finite Automaton for a language L = {010, 1} defined over = {0,1}.

Construct FA (tree structure) over alphabet {0, 1} that accepts all strings that end in 01. The FA must remember the last 2 bits of the string it is reading.

Department of Computer Sciences & IT, MUST, Mirpur (A.K) Subject: Theory of Automata (BCS-3504) Class: BCS-5th Exam: MID Time: 08 hrs-2nd Slot (16:00 pm to 00:00 am) Dated: 11-02-2021 Total Marks: 45 Note: Attempt all questions and upload Answer sheets on CMS 11:59 pm sharp. Q.1:- Do as required for the languages given defined over {={a, b}:- a) Build Finite Automaton for a language L=b*aa*+ (b*a+b+a+). b) Build FA accepting Language L= (a* + atb*a*) + (b* + b*a*b*). c) Build Finite Automaton for a language L = {010, 1} defined over {= {0,1). d) Construct FA (tree structure) over alphabet (0, 1) that accepts all strings that end in 01. The FA must "remember" the last 2 bits of the string it is reading