1 / 31

cs3102: Theory of Computation Class 3: Nondeterminism

PS1 is due now!. cs3102: Theory of Computation Class 3: Nondeterminism. Spring 2010 University of Virginia David Evans. TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: A A A A A A A A A A A A A A A A A A. Adding Nondeterminism. a. b. 1. 2. b. a, b.

ramya
Télécharger la présentation

cs3102: Theory of Computation Class 3: Nondeterminism

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. PS1 is due now! cs3102: Theory of ComputationClass 3: Nondeterminism Spring 2010 University of Virginia David Evans TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AAAAAAAAAAAAAAAAAA

  2. Adding Nondeterminism a b 1 2 b a, b Deterministic machine: at every step, there is only one choice Nondeterministic machine: at some steps, there may be more than one choice.

  3. Nondeterminism in Practice

  4. Nondeterminism in Theory Omnipotent: Machine splits into a new machine for each choice; if any machine accepts, accept. Omniscient: Whenever it has to make a choice, machine always guesses right.

  5. Example NFA a b 1 2 3 a, b

  6. Defining DFAs A deterministic finite automaton is a 5-tuple: Qfinite set (“states”) • finite set (“alphabet”) • : Q    Qtransition function q0  Q start state F  Q set of accepting states How do we need to change this to support nondeterminism?

  7. Defining NFAs A nondeterministic finite automaton is a 5-tuple: Qfinite set (“states”) • finite set (“alphabet”) • transition function q0  Q start state F  Q set of accepting states Output of transition function is a set of states, not just one state.

  8. Computation Model of NFA

  9. Computation Model of NFA

  10. Is an NFA more powerful than a DFA?

  11. Power of Machines Languages that can be recognized by an A Languages that can be recognized by a B A and B are non-comparable.

  12. Power of Machines Languages that can be recognized by an A B is less powerful than A: SomeAcan recognize every language a B can recognize. There is some language that can be recognized by an A but not by any B. Languages that can be recognized by a B

  13. Power of Machines Languages that can be recognized by an A Languages that can be recognized by a B A and B are equal: every language that can be recognized by an A can be recognized by some B every language that can be recognized by a B can be recognized by some A

  14. Power of NFA/DFA Easy part: is there any language a DFA can recognize that cannot be recognized by an NFA? Hard part: is there any language an NFA can recognized that cannot be recognized by a DFA?

  15. L(NFA)  L(DFA) A nondeterministic finite automaton is a 5-tuple: Qfinite set (“states”) • finite set (“alphabet”) • q0  Q start state F  Q set of accepting states Proof by construction: Construct the NFA N corresponding to any DFA A = (Q, , , q0,F): N = (Q, , ’, q0,F) where q  Q, ’(q, ) = reject a   ,’(q, a) = { (q, a) }

  16. Power of NFA/DFA Easy part: is there any language a DFA can recognize that cannot be recognized by an NFA? Hard part: is there any language an NFA can recognized that cannot be recognized by a DFA? No: NFAs are at least as powerful as DFAs.

  17. L(DFA)  L(NFA)

  18. L(DFA)  L(NFA)

  19. Example Conversion a b 1 2 3 a, b

  20. a b 1 2 3 a, b {2} {1, 2} {1} {1, 3} {1,2, 3} {2, 3} {3} {}

  21. a b 1 2 3 a, b a a b {2} {1, 2} {1} {1, 3} b b b a {1,2, 3} {2, 3} {3} {}

  22. Converting NFAs to DFAs How many states may be needed for the DFA corresponding to and NFA with N states? How much bigger is the transition function for the DFA corresponding to and NFA with N states?

  23. Regular Expressions

  24. “something formatted like an [email] address” address@domain [A-Za-z0-9]*@[A-Za-z0-9]*(. [A-Za-z0-9]*)* This matches most email addresses. Matching the full spec of all possible email addresses is left as exercise.

  25. Regular Expression Base: Language a  { a }  {  }  { } Induction:R1, R2 are regular expressions R1  R2 L(R1)  L(R2) R1  R2 { xy | xL(R1) and yL(R2) } R1* { xn | xL(R1) and n ≥ 0 }

  26. How powerful are Regular Expressions? Is there a Regular Expression that describes the same language as any NFA? Is there some NFA that describes the same language as any Regular Expression?

  27. L(RE)  L(NFA) Base: Language a  { a }  {  }  { } Induction:R1, R2 are regular expressions R1  R2 L(R1)  L(R2) R1  R2 { xy | xL(R1) and yL(R2) } R1* { xn | xL(R1) and n ≥ 0 } Proof by construction. Trivial to draw NFAs for Each of these languages.

  28. L(RE)  L(NFA) Base: Language a  { a }  {  }  { } Proof by construction. Trivial to draw NFAs for Each of these languages.

  29. L(RE)  L(NFA) Induction:R1, R2 are regular expressions R1  R2 L(R1)  L(R2) R1  R2 { xy | xL(R1) and yL(R2) } R1* { xn | xL(R1) and n ≥ 0 } Proof by induction and construction. Assume there are NFAs A1 and A2 that recognize the languages L(R1) and L(R2). Show how to construct an NFA that recognizes the produced language for each part.

  30. Proving: R1  R2

  31. Charge • PS2 will be posted by tomorrow • Finish reading Chapter 1 • Thursday: how to prove a language is non-regular

More Related