1 / 15

AUTOMATA THEORY II B Questions Answers(DFA-NFA)

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.

henrik
Download Presentation

AUTOMATA THEORY II B Questions Answers(DFA-NFA)

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. AUTOMATATHEORYII B Questions Answers(DFA-NFA)

  2. 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

  3. 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

  4. 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

  5. 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

  6. 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

  7. 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

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

  9. 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

  10. Automata Theory II B • 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 • 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 • 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 • 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 • Determine the regular expression for the language accepted by the following automaton. A. L = a*.ba* Dept. of Computer Science & IT, FUUAST Automata Theory

  15. END

More Related