NFA NFA DFA equivalence What is an NFA
![NFAε - NFA - DFA equivalence NFAε - NFA - DFA equivalence](https://slidetodoc.com/presentation_image_h2/d6628757198fe85cb4b59aef0a875721/image-1.jpg)
![What is an NFA • An NFA is an automaton that its states might What is an NFA • An NFA is an automaton that its states might](https://slidetodoc.com/presentation_image_h2/d6628757198fe85cb4b59aef0a875721/image-2.jpg)
![What is an NFA • An NFA is an automaton that its states might What is an NFA • An NFA is an automaton that its states might](https://slidetodoc.com/presentation_image_h2/d6628757198fe85cb4b59aef0a875721/image-3.jpg)
![What is an NFAε • An NFAε is an NFA that might have ε-moves. What is an NFAε • An NFAε is an NFA that might have ε-moves.](https://slidetodoc.com/presentation_image_h2/d6628757198fe85cb4b59aef0a875721/image-4.jpg)
![What is an NFAε • An NFAε is an NFA that might have ε-moves. What is an NFAε • An NFAε is an NFA that might have ε-moves.](https://slidetodoc.com/presentation_image_h2/d6628757198fe85cb4b59aef0a875721/image-5.jpg)
![NFA – NFAε computation • An Non-Deterministic FA can have choices. If there are NFA – NFAε computation • An Non-Deterministic FA can have choices. If there are](https://slidetodoc.com/presentation_image_h2/d6628757198fe85cb4b59aef0a875721/image-6.jpg)
![NFA – NFAε computation An Non-Deterministic Finite Automaton accepts an input string s if NFA – NFAε computation An Non-Deterministic Finite Automaton accepts an input string s if](https://slidetodoc.com/presentation_image_h2/d6628757198fe85cb4b59aef0a875721/image-7.jpg)
![Example 0 1 q 0 0, 1 q 1 • This automaton accepts the Example 0 1 q 0 0, 1 q 1 • This automaton accepts the](https://slidetodoc.com/presentation_image_h2/d6628757198fe85cb4b59aef0a875721/image-8.jpg)
![Example 0 1 q 0 0, 1 q 1 • This automaton accepts the Example 0 1 q 0 0, 1 q 1 • This automaton accepts the](https://slidetodoc.com/presentation_image_h2/d6628757198fe85cb4b59aef0a875721/image-9.jpg)
![Example 0 1 q 0 0, 1 q 1 • This automaton accepts the Example 0 1 q 0 0, 1 q 1 • This automaton accepts the](https://slidetodoc.com/presentation_image_h2/d6628757198fe85cb4b59aef0a875721/image-10.jpg)
![Example 0 1 q 0 0, 1 q 1 • This automaton accepts the Example 0 1 q 0 0, 1 q 1 • This automaton accepts the](https://slidetodoc.com/presentation_image_h2/d6628757198fe85cb4b59aef0a875721/image-11.jpg)
![Example 0 1 q 0 0, 1 q 1 • This automaton accepts the Example 0 1 q 0 0, 1 q 1 • This automaton accepts the](https://slidetodoc.com/presentation_image_h2/d6628757198fe85cb4b59aef0a875721/image-12.jpg)
![Example 0 1 q 0 0, 1 q 1 • And that is so Example 0 1 q 0 0, 1 q 1 • And that is so](https://slidetodoc.com/presentation_image_h2/d6628757198fe85cb4b59aef0a875721/image-13.jpg)
![Example 0 1 q 0 0, 1 q 1 • And that is so Example 0 1 q 0 0, 1 q 1 • And that is so](https://slidetodoc.com/presentation_image_h2/d6628757198fe85cb4b59aef0a875721/image-14.jpg)
![Example 0 1 q 0 0, 1 q 1 • And that is so Example 0 1 q 0 0, 1 q 1 • And that is so](https://slidetodoc.com/presentation_image_h2/d6628757198fe85cb4b59aef0a875721/image-15.jpg)
![Example 0 1 q 0 0, 1 q 1 • However it doesn’t accept Example 0 1 q 0 0, 1 q 1 • However it doesn’t accept](https://slidetodoc.com/presentation_image_h2/d6628757198fe85cb4b59aef0a875721/image-16.jpg)
![Example 0 1 q 0 0, 1 q 1 • However it doesn’t accept Example 0 1 q 0 0, 1 q 1 • However it doesn’t accept](https://slidetodoc.com/presentation_image_h2/d6628757198fe85cb4b59aef0a875721/image-17.jpg)
![Example 0 1 q 0 0, 1 q 1 • However it doesn’t accept Example 0 1 q 0 0, 1 q 1 • However it doesn’t accept](https://slidetodoc.com/presentation_image_h2/d6628757198fe85cb4b59aef0a875721/image-18.jpg)
![NFA - NFAε acceptance • The language that a Non–Deterministic FA recognizes is the NFA - NFAε acceptance • The language that a Non–Deterministic FA recognizes is the](https://slidetodoc.com/presentation_image_h2/d6628757198fe85cb4b59aef0a875721/image-19.jpg)
![NFA acceptance • Whenever an arrow is followed, there is a set of possible NFA acceptance • Whenever an arrow is followed, there is a set of possible](https://slidetodoc.com/presentation_image_h2/d6628757198fe85cb4b59aef0a875721/image-20.jpg)
![Is NFA more powerful than DFA? • Designing an NFA is sometimes mush easier Is NFA more powerful than DFA? • Designing an NFA is sometimes mush easier](https://slidetodoc.com/presentation_image_h2/d6628757198fe85cb4b59aef0a875721/image-21.jpg)
![NFA – DFA equivalence • It is obvious that a DFA is also an NFA – DFA equivalence • It is obvious that a DFA is also an](https://slidetodoc.com/presentation_image_h2/d6628757198fe85cb4b59aef0a875721/image-22.jpg)
![NFA – DFA equivalence • An NFA might have more than one or no NFA – DFA equivalence • An NFA might have more than one or no](https://slidetodoc.com/presentation_image_h2/d6628757198fe85cb4b59aef0a875721/image-23.jpg)
![NFA – DFA equivalence • An NFA might have more than one or no NFA – DFA equivalence • An NFA might have more than one or no](https://slidetodoc.com/presentation_image_h2/d6628757198fe85cb4b59aef0a875721/image-24.jpg)
![NFA – DFA equivalence • The new DFA can possibly contain one state for NFA – DFA equivalence • The new DFA can possibly contain one state for](https://slidetodoc.com/presentation_image_h2/d6628757198fe85cb4b59aef0a875721/image-25.jpg)
![NFA → DFA Suppose that you want to find an equivalent DFA for an NFA → DFA Suppose that you want to find an equivalent DFA for an](https://slidetodoc.com/presentation_image_h2/d6628757198fe85cb4b59aef0a875721/image-26.jpg)
![NFA → DFA Suppose that you want to find an equivalent DFA for an NFA → DFA Suppose that you want to find an equivalent DFA for an](https://slidetodoc.com/presentation_image_h2/d6628757198fe85cb4b59aef0a875721/image-27.jpg)
![NFA → DFA Suppose that you want to find an equivalent DFA for an NFA → DFA Suppose that you want to find an equivalent DFA for an](https://slidetodoc.com/presentation_image_h2/d6628757198fe85cb4b59aef0a875721/image-28.jpg)
![NFA – DFA equivalence (example) To find an equivalent DFA to the NFA of NFA – DFA equivalence (example) To find an equivalent DFA to the NFA of](https://slidetodoc.com/presentation_image_h2/d6628757198fe85cb4b59aef0a875721/image-29.jpg)
![NFA – DFA equivalence (example) 0, 1 So the DFA is: 0 1 q NFA – DFA equivalence (example) 0, 1 So the DFA is: 0 1 q](https://slidetodoc.com/presentation_image_h2/d6628757198fe85cb4b59aef0a875721/image-30.jpg)
![NFAε – NFA equivalence • An NFAε is an NFA which might have ε-moves. NFAε – NFA equivalence • An NFAε is an NFA which might have ε-moves.](https://slidetodoc.com/presentation_image_h2/d6628757198fe85cb4b59aef0a875721/image-31.jpg)
![NFAε – NFA equivalence • Suppose that I have an ε-move like the one NFAε – NFA equivalence • Suppose that I have an ε-move like the one](https://slidetodoc.com/presentation_image_h2/d6628757198fe85cb4b59aef0a875721/image-32.jpg)
![NFAε – NFA equivalence • If an ε-move takes me from q 1 to NFAε – NFA equivalence • If an ε-move takes me from q 1 to](https://slidetodoc.com/presentation_image_h2/d6628757198fe85cb4b59aef0a875721/image-33.jpg)
![Example 0, ε 1 q 0 q 1 1, ε 1 q 2 0 Example 0, ε 1 q 0 q 1 1, ε 1 q 2 0](https://slidetodoc.com/presentation_image_h2/d6628757198fe85cb4b59aef0a875721/image-34.jpg)
![Example 0, ε 1 q 0 q 1 1, ε 1 q 2 0 Example 0, ε 1 q 0 q 1 1, ε 1 q 2 0](https://slidetodoc.com/presentation_image_h2/d6628757198fe85cb4b59aef0a875721/image-35.jpg)
![Example 0, ε 1 q 0 q 1 1, ε 1 q 2 0 Example 0, ε 1 q 0 q 1 1, ε 1 q 2 0](https://slidetodoc.com/presentation_image_h2/d6628757198fe85cb4b59aef0a875721/image-36.jpg)
![Example 0, ε 1 q 0 1 q 1 1 q 2 0 0 Example 0, ε 1 q 0 1 q 1 1 q 2 0 0](https://slidetodoc.com/presentation_image_h2/d6628757198fe85cb4b59aef0a875721/image-37.jpg)
![Example 0, ε 1 q 0 1 q 1 1 q 2 0 0 Example 0, ε 1 q 0 1 q 1 1 q 2 0 0](https://slidetodoc.com/presentation_image_h2/d6628757198fe85cb4b59aef0a875721/image-38.jpg)
![Example 0 0, ε 1 q 0 q 1 1 1 q 2 0 Example 0 0, ε 1 q 0 q 1 1 1 q 2 0](https://slidetodoc.com/presentation_image_h2/d6628757198fe85cb4b59aef0a875721/image-39.jpg)
![Example 0 0, ε 1 q 0 q 1 1 1 q 2 0 Example 0 0, ε 1 q 0 q 1 1 1 q 2 0](https://slidetodoc.com/presentation_image_h2/d6628757198fe85cb4b59aef0a875721/image-40.jpg)
![Example 0 0 1 q 0 q 1 1 1 q 2 0 , Example 0 0 1 q 0 q 1 1 1 q 2 0 ,](https://slidetodoc.com/presentation_image_h2/d6628757198fe85cb4b59aef0a875721/image-41.jpg)
![Example 0 0 1 q 0 q 1 1 1 q 2 0, 1 Example 0 0 1 q 0 q 1 1 1 q 2 0, 1](https://slidetodoc.com/presentation_image_h2/d6628757198fe85cb4b59aef0a875721/image-42.jpg)
- Slides: 42
![NFAε NFA DFA equivalence NFAε - NFA - DFA equivalence](https://slidetodoc.com/presentation_image_h2/d6628757198fe85cb4b59aef0a875721/image-1.jpg)
NFAε - NFA - DFA equivalence
![What is an NFA An NFA is an automaton that its states might What is an NFA • An NFA is an automaton that its states might](https://slidetodoc.com/presentation_image_h2/d6628757198fe85cb4b59aef0a875721/image-2.jpg)
What is an NFA • An NFA is an automaton that its states might have none, one or more outgoing arrows under a specific symbol. 1 q 0 0, 1 q 1 • From q 0 with 1 we can be either in q 0 or q 1. • No outgoing arrows under 0 or 1 from q 1.
![What is an NFA An NFA is an automaton that its states might What is an NFA • An NFA is an automaton that its states might](https://slidetodoc.com/presentation_image_h2/d6628757198fe85cb4b59aef0a875721/image-3.jpg)
What is an NFA • An NFA is an automaton that its states might have none, one or more outgoing arrows under a specific symbol. 1 q 0 0, 1 q 1 • A DFA is by definition an NFA (each state has exactly one outgoing arrow under each symbol).
![What is an NFAε An NFAε is an NFA that might have εmoves What is an NFAε • An NFAε is an NFA that might have ε-moves.](https://slidetodoc.com/presentation_image_h2/d6628757198fe85cb4b59aef0a875721/image-4.jpg)
What is an NFAε • An NFAε is an NFA that might have ε-moves. In an ε-move we can transport from one state to the other without having any symbols. 1 q 0 ε q 1 1 q 2 • From q 0 with 1 we can be either in q 0 or q 2.
![What is an NFAε An NFAε is an NFA that might have εmoves What is an NFAε • An NFAε is an NFA that might have ε-moves.](https://slidetodoc.com/presentation_image_h2/d6628757198fe85cb4b59aef0a875721/image-5.jpg)
What is an NFAε • An NFAε is an NFA that might have ε-moves. In an ε-move we can transport from one state to the other without having any symbols. 1 q 0 ε q 1 1 q 2 • An NFA is by definition an NFAε (but with no εmoves).
![NFA NFAε computation An NonDeterministic FA can have choices If there are NFA – NFAε computation • An Non-Deterministic FA can have choices. If there are](https://slidetodoc.com/presentation_image_h2/d6628757198fe85cb4b59aef0a875721/image-6.jpg)
NFA – NFAε computation • An Non-Deterministic FA can have choices. If there are two possible transitions under a specific symbol, it can choose either of them and follow it. • Given some input string, there might be more than one paths to follow. Some of them might fail but, in order to accept, it suffices to find one that succeeds.
![NFA NFAε computation An NonDeterministic Finite Automaton accepts an input string s if NFA – NFAε computation An Non-Deterministic Finite Automaton accepts an input string s if](https://slidetodoc.com/presentation_image_h2/d6628757198fe85cb4b59aef0a875721/image-7.jpg)
NFA – NFAε computation An Non-Deterministic Finite Automaton accepts an input string s if there exists a path following transitions under the symbols of s consecutively, that leads to an accepting state.
![Example 0 1 q 0 0 1 q 1 This automaton accepts the Example 0 1 q 0 0, 1 q 1 • This automaton accepts the](https://slidetodoc.com/presentation_image_h2/d6628757198fe85cb4b59aef0a875721/image-8.jpg)
Example 0 1 q 0 0, 1 q 1 • This automaton accepts the string 1110 because there is a path under 1110 that takes us to an accepting state (the path q 0 → 1 q 0 → 0 q 1).
![Example 0 1 q 0 0 1 q 1 This automaton accepts the Example 0 1 q 0 0, 1 q 1 • This automaton accepts the](https://slidetodoc.com/presentation_image_h2/d6628757198fe85cb4b59aef0a875721/image-9.jpg)
Example 0 1 q 0 0, 1 q 1 • This automaton accepts the string 1110 because there is a path under 1110 that takes us to an accepting state (the path q 0 → 1 q 0 → 0 q 1).
![Example 0 1 q 0 0 1 q 1 This automaton accepts the Example 0 1 q 0 0, 1 q 1 • This automaton accepts the](https://slidetodoc.com/presentation_image_h2/d6628757198fe85cb4b59aef0a875721/image-10.jpg)
Example 0 1 q 0 0, 1 q 1 • This automaton accepts the string 1110 because there is a path under 1110 that takes us to an accepting state (the path q 0 → 1 q 0 → 0 q 1).
![Example 0 1 q 0 0 1 q 1 This automaton accepts the Example 0 1 q 0 0, 1 q 1 • This automaton accepts the](https://slidetodoc.com/presentation_image_h2/d6628757198fe85cb4b59aef0a875721/image-11.jpg)
Example 0 1 q 0 0, 1 q 1 • This automaton accepts the string 1110 because there is a path under 1110 that takes us to an accepting state (the path q 0 → 1 q 0 → 0 q 1).
![Example 0 1 q 0 0 1 q 1 This automaton accepts the Example 0 1 q 0 0, 1 q 1 • This automaton accepts the](https://slidetodoc.com/presentation_image_h2/d6628757198fe85cb4b59aef0a875721/image-12.jpg)
Example 0 1 q 0 0, 1 q 1 • This automaton accepts the string 1110 because there is a path under 1110 that takes us to an accepting state (the path q 0 → 1 q 0 → 0 q 1).
![Example 0 1 q 0 0 1 q 1 And that is so Example 0 1 q 0 0, 1 q 1 • And that is so](https://slidetodoc.com/presentation_image_h2/d6628757198fe85cb4b59aef0a875721/image-13.jpg)
Example 0 1 q 0 0, 1 q 1 • And that is so despite the fact that there are some other paths under 1110 which do not lead to an accepting state (for example the path q 0 → 1 q 0).
![Example 0 1 q 0 0 1 q 1 And that is so Example 0 1 q 0 0, 1 q 1 • And that is so](https://slidetodoc.com/presentation_image_h2/d6628757198fe85cb4b59aef0a875721/image-14.jpg)
Example 0 1 q 0 0, 1 q 1 • And that is so despite the fact that there are some other paths under 1110 which do not lead to an accepting state (for example the path q 0 → 1 q 0).
![Example 0 1 q 0 0 1 q 1 And that is so Example 0 1 q 0 0, 1 q 1 • And that is so](https://slidetodoc.com/presentation_image_h2/d6628757198fe85cb4b59aef0a875721/image-15.jpg)
Example 0 1 q 0 0, 1 q 1 • And that is so despite the fact that there are some other paths under 1110 which do not lead to an accepting state (for example the path q 0 → 1 q 0).
![Example 0 1 q 0 0 1 q 1 However it doesnt accept Example 0 1 q 0 0, 1 q 1 • However it doesn’t accept](https://slidetodoc.com/presentation_image_h2/d6628757198fe85cb4b59aef0a875721/image-16.jpg)
Example 0 1 q 0 0, 1 q 1 • However it doesn’t accept the string 00 because there are no paths under 00 to take us to q 1. (only possible path is q 0 → 0 q 1 → 0 q 0).
![Example 0 1 q 0 0 1 q 1 However it doesnt accept Example 0 1 q 0 0, 1 q 1 • However it doesn’t accept](https://slidetodoc.com/presentation_image_h2/d6628757198fe85cb4b59aef0a875721/image-17.jpg)
Example 0 1 q 0 0, 1 q 1 • However it doesn’t accept the string 00 because there are no paths under 00 to take us to q 1. (only possible path is q 0 → 0 q 1 → 0 q 0).
![Example 0 1 q 0 0 1 q 1 However it doesnt accept Example 0 1 q 0 0, 1 q 1 • However it doesn’t accept](https://slidetodoc.com/presentation_image_h2/d6628757198fe85cb4b59aef0a875721/image-18.jpg)
Example 0 1 q 0 0, 1 q 1 • However it doesn’t accept the string 00 because there are no paths under 00 to take us to q 1. (only possible path is q 0 → 0 q 1 → 0 q 0).
![NFA NFAε acceptance The language that a NonDeterministic FA recognizes is the NFA - NFAε acceptance • The language that a Non–Deterministic FA recognizes is the](https://slidetodoc.com/presentation_image_h2/d6628757198fe85cb4b59aef0a875721/image-19.jpg)
NFA - NFAε acceptance • The language that a Non–Deterministic FA recognizes is the set of strings which accepts. • To see whether a string can get accepted or not, it suffices to find the set of all possible states in which the automaton can be following all possible transitions suggested by this string as an input and see if a final state is contained in this set.
![NFA acceptance Whenever an arrow is followed there is a set of possible NFA acceptance • Whenever an arrow is followed, there is a set of possible](https://slidetodoc.com/presentation_image_h2/d6628757198fe85cb4b59aef0a875721/image-20.jpg)
NFA acceptance • Whenever an arrow is followed, there is a set of possible following states that the NFA can be. This set of states is a subset of Q. • For example with input being 0010 I have the following sequence of sets of states: 0 1 q 0 0, 1 q 1 0 q 2
![Is NFA more powerful than DFA Designing an NFA is sometimes mush easier Is NFA more powerful than DFA? • Designing an NFA is sometimes mush easier](https://slidetodoc.com/presentation_image_h2/d6628757198fe85cb4b59aef0a875721/image-21.jpg)
Is NFA more powerful than DFA? • Designing an NFA is sometimes mush easier than constructing a DFA. For example, the following NFA recognizes the language of all binary strings that end with 010. 0, 1 q 0 0 q 1 1 q 2 0 q 3
![NFA DFA equivalence It is obvious that a DFA is also an NFA – DFA equivalence • It is obvious that a DFA is also an](https://slidetodoc.com/presentation_image_h2/d6628757198fe85cb4b59aef0a875721/image-22.jpg)
NFA – DFA equivalence • It is obvious that a DFA is also an NFA. • Somebody would expect the NFA to be more powerful. We will see that this is not the case!
![NFA DFA equivalence An NFA might have more than one or no NFA – DFA equivalence • An NFA might have more than one or no](https://slidetodoc.com/presentation_image_h2/d6628757198fe85cb4b59aef0a875721/image-23.jpg)
NFA – DFA equivalence • An NFA might have more than one or no transitions under some symbol of the alphabet. a q’’ q
![NFA DFA equivalence An NFA might have more than one or no NFA – DFA equivalence • An NFA might have more than one or no](https://slidetodoc.com/presentation_image_h2/d6628757198fe85cb4b59aef0a875721/image-24.jpg)
NFA – DFA equivalence • An NFA might have more than one or no transitions under some symbol of the alphabet. • I can simulate all possible transitions in one new state. This state should contain all the reachable states under the same symbol. a q’ q q a q’’ a q’ q’’
![NFA DFA equivalence The new DFA can possibly contain one state for NFA – DFA equivalence • The new DFA can possibly contain one state for](https://slidetodoc.com/presentation_image_h2/d6628757198fe85cb4b59aef0a875721/image-25.jpg)
NFA – DFA equivalence • The new DFA can possibly contain one state for each subset of states of the NFA. • Since all the subsets of Q are 2|Q| in total, this should be a finite (≤ 2|Q|) number of subsets! • The NFA accepts if there is at least one path that takes us to an accepting state. Thus, each subset-state of the DFA containing an accepting state of the NFA should be an accepting one.
![NFA DFA Suppose that you want to find an equivalent DFA for an NFA → DFA Suppose that you want to find an equivalent DFA for an](https://slidetodoc.com/presentation_image_h2/d6628757198fe85cb4b59aef0a875721/image-26.jpg)
NFA → DFA Suppose that you want to find an equivalent DFA for an NFA. The algorithm is the following: • Starting from the start state and for each symbol in the alphabet, find the subset of states that can be reached after following this symbol and create a new state for each subset.
![NFA DFA Suppose that you want to find an equivalent DFA for an NFA → DFA Suppose that you want to find an equivalent DFA for an](https://slidetodoc.com/presentation_image_h2/d6628757198fe85cb4b59aef0a875721/image-27.jpg)
NFA → DFA Suppose that you want to find an equivalent DFA for an NFA. The algorithm is the following: • Repeat the same process for every new subset -state that you are creating…
![NFA DFA Suppose that you want to find an equivalent DFA for an NFA → DFA Suppose that you want to find an equivalent DFA for an](https://slidetodoc.com/presentation_image_h2/d6628757198fe85cb4b59aef0a875721/image-28.jpg)
NFA → DFA Suppose that you want to find an equivalent DFA for an NFA. The algorithm is the following: • Repeat the same process for every new subset -state that you are creating… • … until no new subset-state can be created.
![NFA DFA equivalence example To find an equivalent DFA to the NFA of NFA – DFA equivalence (example) To find an equivalent DFA to the NFA of](https://slidetodoc.com/presentation_image_h2/d6628757198fe85cb4b59aef0a875721/image-29.jpg)
NFA – DFA equivalence (example) To find an equivalent DFA to the NFA of the figure we complete the following table: q 0 {q 1} {q 0, q 1} 0 {q 1} {q 0, q 2} {q 0, q 1, q 2} 1 {q 0, q 1} {q 0, q 2} {q 1} {q 0, q 1, q 2} 0 1 q 0 {q 0, q 1} 0, 1 q 1 0 q 2
![NFA DFA equivalence example 0 1 So the DFA is 0 1 q NFA – DFA equivalence (example) 0, 1 So the DFA is: 0 1 q](https://slidetodoc.com/presentation_image_h2/d6628757198fe85cb4b59aef0a875721/image-30.jpg)
NFA – DFA equivalence (example) 0, 1 So the DFA is: 0 1 q 0 {q 1} {q 0, q 1} 0 {q 1} {q 0, q 2} {q 0, q 1, q 2} 1 {q 0, q 1} {q 0, q 2} {q 1} {q 0, q 1, q 2} {q 0, q 1} q 0 0 q 1 1 1 q 01 0 1 q 012 q 02 0 1 0
![NFAε NFA equivalence An NFAε is an NFA which might have εmoves NFAε – NFA equivalence • An NFAε is an NFA which might have ε-moves.](https://slidetodoc.com/presentation_image_h2/d6628757198fe85cb4b59aef0a875721/image-31.jpg)
NFAε – NFA equivalence • An NFAε is an NFA which might have ε-moves. • Again, somebody would think that this attribute can make NFAε more powerful than NFA. This is not the case since I can get rid of the ε-moves.
![NFAε NFA equivalence Suppose that I have an εmove like the one NFAε – NFA equivalence • Suppose that I have an ε-move like the one](https://slidetodoc.com/presentation_image_h2/d6628757198fe85cb4b59aef0a875721/image-32.jpg)
NFAε – NFA equivalence • Suppose that I have an ε-move like the one shown in the figure. Since an ε-move is like teleporting from q 1 to q 2, I can remove the ε-move and add transitions from q 1 directly to every neighbor of q 2. 0 q 1 ε q 2 0 1 0 q 3 q 4 q 5 q 1 0 1 q 3 q 4 q 5 0 0 1 q 2
![NFAε NFA equivalence If an εmove takes me from q 1 to NFAε – NFA equivalence • If an ε-move takes me from q 1 to](https://slidetodoc.com/presentation_image_h2/d6628757198fe85cb4b59aef0a875721/image-33.jpg)
NFAε – NFA equivalence • If an ε-move takes me from q 1 to q 2 and q 2 is an accepting state, then, when removing the ε-move, I should convert q 1 to an accepting state. q 1 ε q 2 0 q 4 q 1 q 2 0 0 q 4
![Example 0 ε 1 q 0 q 1 1 ε 1 q 2 0 Example 0, ε 1 q 0 q 1 1, ε 1 q 2 0](https://slidetodoc.com/presentation_image_h2/d6628757198fe85cb4b59aef0a875721/image-34.jpg)
Example 0, ε 1 q 0 q 1 1, ε 1 q 2 0 1 q 3 q 4
![Example 0 ε 1 q 0 q 1 1 ε 1 q 2 0 Example 0, ε 1 q 0 q 1 1, ε 1 q 2 0](https://slidetodoc.com/presentation_image_h2/d6628757198fe85cb4b59aef0a875721/image-35.jpg)
Example 0, ε 1 q 0 q 1 1, ε 1 q 2 0 1 q 3 q 4
![Example 0 ε 1 q 0 q 1 1 ε 1 q 2 0 Example 0, ε 1 q 0 q 1 1, ε 1 q 2 0](https://slidetodoc.com/presentation_image_h2/d6628757198fe85cb4b59aef0a875721/image-36.jpg)
Example 0, ε 1 q 0 q 1 1, ε 1 q 2 0 1 q 3 q 4
![Example 0 ε 1 q 0 1 q 1 1 q 2 0 0 Example 0, ε 1 q 0 1 q 1 1 q 2 0 0](https://slidetodoc.com/presentation_image_h2/d6628757198fe85cb4b59aef0a875721/image-37.jpg)
Example 0, ε 1 q 0 1 q 1 1 q 2 0 0 1 q 3 q 4
![Example 0 ε 1 q 0 1 q 1 1 q 2 0 0 Example 0, ε 1 q 0 1 q 1 1 q 2 0 0](https://slidetodoc.com/presentation_image_h2/d6628757198fe85cb4b59aef0a875721/image-38.jpg)
Example 0, ε 1 q 0 1 q 1 1 q 2 0 0 1 q 3 q 4
![Example 0 0 ε 1 q 0 q 1 1 1 q 2 0 Example 0 0, ε 1 q 0 q 1 1 1 q 2 0](https://slidetodoc.com/presentation_image_h2/d6628757198fe85cb4b59aef0a875721/image-39.jpg)
Example 0 0, ε 1 q 0 q 1 1 1 q 2 0 0, 1 1 q 3 q 4
![Example 0 0 ε 1 q 0 q 1 1 1 q 2 0 Example 0 0, ε 1 q 0 q 1 1 1 q 2 0](https://slidetodoc.com/presentation_image_h2/d6628757198fe85cb4b59aef0a875721/image-40.jpg)
Example 0 0, ε 1 q 0 q 1 1 1 q 2 0 0, 1 1 q 3 q 4
![Example 0 0 1 q 0 q 1 1 1 q 2 0 Example 0 0 1 q 0 q 1 1 1 q 2 0 ,](https://slidetodoc.com/presentation_image_h2/d6628757198fe85cb4b59aef0a875721/image-41.jpg)
Example 0 0 1 q 0 q 1 1 1 q 2 0 , 1 0, 1 1 q 3 q 4
![Example 0 0 1 q 0 q 1 1 1 q 2 0 1 Example 0 0 1 q 0 q 1 1 1 q 2 0, 1](https://slidetodoc.com/presentation_image_h2/d6628757198fe85cb4b59aef0a875721/image-42.jpg)
Example 0 0 1 q 0 q 1 1 1 q 2 0, 1 1 q 3 q 4
Dfa and nfa
Nfa vs dfa
Nfa to dfa conversion solved examples
Dfa yang ekuivalen dengan nfa
Convert nfa to dfa
Nfa
Nfa to dfa
Dari sebuah mesin nfa dapat dibuat mesin dfa yang
Dfa to nfa
Nfa to dfa subset construction method
Convert nfa to dfa
Nfa dfa
Dfa and nfa
Transition diagram for relational operator
Subset construction nfa to dfa calculator
Nfa
Dfa for (a/b)*abb
Nfa vs dfa
Automata
Tentukan dfa hasil ekuivalensi dari nfa tersebut
Dfa yang ekuivalen dengan nfa
Equivalence of dfa and ndfa
Complete equivalence vs creativity
Diastereotopic protons
Dynamic equivalence theory
Dfa for floating point numbers
Automata
Dfa minimization examples
Dfa for (a/b)*abb
Minimization of dfa
Reduksi dfa
What language does the given dfa accepts
Minimize dfa
Scott korzenowski
Closure properties of dfa
Moore to mealy conversion
Formal definition of dfa,
Dfa
Tabel transisi dfa
Nyseslat dfa
Kmp dfa
Extended transition function of dfa
Nfa for text search