Dept. of Computer Science & IT, FUUAST Automata Theory 2 Automata Theory II B Q.For  = {a, b} construct DFA that accepts all strings with exactly one ‘a’. A.

Dept. of Computer Science & IT, FUUAST Automata Theory 3 Automata Theory II B Q.For  = {a, b} construct DFA that accepts all strings with at least one ‘a’. A.

Dept. of Computer Science & IT, FUUAST Automata Theory 4 Automata Theory II B Q.For  = {a, b} construct DFA that accepts all strings with no more than three a’s. A.

Dept. of Computer Science & IT, FUUAST Automata Theory 5 Automata Theory II B Q.For  = {a, b} construct DFA that accepts all strings with at least one ‘a’ and exactly two b’s. A.

Dept. of Computer Science & IT, FUUAST Automata Theory 6 Automata Theory II B Q.Determine a DFA that accepts all strings on {0, 1} except those containing the substring 001. A.

Dept. of Computer Science & IT, FUUAST Automata Theory 7 Automata Theory II B Q.Obtain the NFA for a language defined by L = {a n b m | n,m  1} A.

Dept. of Computer Science & IT, FUUAST Automata Theory 8 Automata Theory II B Q.Construct an NFA for the state table given below. A.

Dept. of Computer Science & IT, FUUAST Automata Theory 9 Automata Theory II B Q.Obtain the language recognized by the NDA shown below. A. L = { 0 n, 0 n 01, 0 n 11 | n  0

Dept. of Computer Science & IT, FUUAST Automata Theory 10 Automata Theory II B Q.Determine the DFA that accepts the language L(aa* + aba* + b*) A.

Dept. of Computer Science & IT, FUUAST Automata Theory 11 Automata Theory II B Q.Determine the DFA that accepts the language L(ab(a + ab*(a + aa))) A.

Dept. of Computer Science & IT, FUUAST Automata Theory 12 Automata Theory II B Q.Determine the regular expression for the language accepted by the following automaton. A. L = b*.aa*.ab*.a

Dept. of Computer Science & IT, FUUAST Automata Theory 13 Automata Theory II B Q.Determine the regular expression for the language accepted by the following automaton. A. L = (aabb)* + b(bab)*.(ba)*b + (ab)*

Dept. of Computer Science & IT, FUUAST Automata Theory 14 Automata Theory II B Q.Determine the regular expression for the language accepted by the following automaton. A. L = a*.ba*