260 likes | 845 Views
AUTOMATA THEORY II B Questions Answers(DFA-NFA) . Automata Theory II B. For = {a, b} construct DFA that accepts all strings with exactly one ‘a’ . A. Automata Theory II B. For = {a, b} construct DFA that accepts all strings with at least one ‘a’ . A. Automata Theory II B.
E N D
AUTOMATATHEORYII B Questions Answers(DFA-NFA)
Automata Theory II B • For = {a, b} construct DFA that accepts all strings with exactly one ‘a’ . A. Dept. of Computer Science & IT, FUUAST Automata Theory
Automata Theory II B • For = {a, b} construct DFA that accepts all strings with at least one ‘a’ . A. Dept. of Computer Science & IT, FUUAST Automata Theory
Automata Theory II B • 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
Automata Theory II B • 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
Automata Theory II B • 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
Automata Theory II B • Obtain the NFA for a language defined by • L = {anbm | n,m 1} A. Dept. of Computer Science & IT, FUUAST Automata Theory
Automata Theory II B • Construct an NFA for the state table given below. A. Dept. of Computer Science & IT, FUUAST Automata Theory
Automata Theory II B • Obtain the language recognized by the NDA shown below. A. L = { 0n, 0n01, 0n11 | n 0 Dept. of Computer Science & IT, FUUAST Automata Theory
Automata Theory II B • Determine the DFA that accepts the language • L(aa* + aba* + b*) A. Dept. of Computer Science & IT, FUUAST Automata Theory
Automata Theory II B • Determine the DFA that accepts the language • L(ab(a + ab*(a + aa))) A. Dept. of Computer Science & IT, FUUAST Automata Theory
Automata Theory II B • 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
Automata Theory II B • 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
Automata Theory II B • Determine the regular expression for the language accepted by the following automaton. A. L = a*.ba* Dept. of Computer Science & IT, FUUAST Automata Theory