NonDeterministic Finite Automata 1 Nondeterministic Finite Automaton NFA
![Non-Deterministic Finite Automata 1 Non-Deterministic Finite Automata 1](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-1.jpg)
![Nondeterministic Finite Automaton (NFA) Alphabet = 2 Nondeterministic Finite Automaton (NFA) Alphabet = 2](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-2.jpg)
![Alphabet = Two choices 3 Alphabet = Two choices 3](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-3.jpg)
![Alphabet = Two choices No transition 4 Alphabet = Two choices No transition 4](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-4.jpg)
![First Choice 5 First Choice 5](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-5.jpg)
![First Choice 6 First Choice 6](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-6.jpg)
![First Choice All input is consumed “accept” 7 First Choice All input is consumed “accept” 7](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-7.jpg)
![Second Choice 8 Second Choice 8](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-8.jpg)
![Second Choice Input cannot be consumed Automaton Halts “reject” 9 Second Choice Input cannot be consumed Automaton Halts “reject” 9](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-9.jpg)
![An NFA accepts a string: if there is a computation of the NFA that An NFA accepts a string: if there is a computation of the NFA that](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-10.jpg)
![is accepted by the NFA: “accept” because this computation accepts “reject” this computation is is accepted by the NFA: “accept” because this computation accepts “reject” this computation is](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-11.jpg)
![Rejection example 12 Rejection example 12](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-12.jpg)
![First Choice “reject” 13 First Choice “reject” 13](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-13.jpg)
![Second Choice 14 Second Choice 14](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-14.jpg)
![Second Choice “reject” 15 Second Choice “reject” 15](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-15.jpg)
![Another Rejection example 16 Another Rejection example 16](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-16.jpg)
![First Choice 17 First Choice 17](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-17.jpg)
![First Choice Input cannot be consumed “reject” Automaton halts 18 First Choice Input cannot be consumed “reject” Automaton halts 18](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-18.jpg)
![Second Choice 19 Second Choice 19](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-19.jpg)
![Second Choice Input cannot be consumed Automaton halts “reject” 20 Second Choice Input cannot be consumed Automaton halts “reject” 20](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-20.jpg)
![An NFA rejects a string: if there is no computation of the NFA that An NFA rejects a string: if there is no computation of the NFA that](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-21.jpg)
![is rejected by the NFA: “reject” All possible computations lead to rejection 22 is rejected by the NFA: “reject” All possible computations lead to rejection 22](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-22.jpg)
![is rejected by the NFA: “reject” All possible computations lead to rejection 23 is rejected by the NFA: “reject” All possible computations lead to rejection 23](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-23.jpg)
![Language accepted: 24 Language accepted: 24](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-24.jpg)
![Lambda Transitions 25 Lambda Transitions 25](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-25.jpg)
![26 26](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-26.jpg)
![27 27](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-27.jpg)
![input tape head does not move 28 input tape head does not move 28](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-28.jpg)
![all input is consumed “accept” String is accepted 29 all input is consumed “accept” String is accepted 29](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-29.jpg)
![Rejection Example 30 Rejection Example 30](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-30.jpg)
![31 31](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-31.jpg)
![(read head doesn’t move) 32 (read head doesn’t move) 32](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-32.jpg)
![Input cannot be consumed Automaton halts “reject” String is rejected 33 Input cannot be consumed Automaton halts “reject” String is rejected 33](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-33.jpg)
![Language accepted: 34 Language accepted: 34](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-34.jpg)
![Another NFA Example 35 Another NFA Example 35](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-35.jpg)
![36 36](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-36.jpg)
![37 37](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-37.jpg)
![“accept” 38 “accept” 38](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-38.jpg)
![Another String 39 Another String 39](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-39.jpg)
![40 40](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-40.jpg)
![41 41](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-41.jpg)
![42 42](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-42.jpg)
![43 43](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-43.jpg)
![44 44](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-44.jpg)
![“accept” 45 “accept” 45](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-45.jpg)
![Language accepted 46 Language accepted 46](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-46.jpg)
![Another NFA Example 47 Another NFA Example 47](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-47.jpg)
![Language accepted (redundant state) 48 Language accepted (redundant state) 48](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-48.jpg)
![Remarks: • The symbol never appears on the input tape • Simple automata: 49 Remarks: • The symbol never appears on the input tape • Simple automata: 49](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-49.jpg)
![• NFAs are interesting because we can express languages easier than DFAs NFA • NFAs are interesting because we can express languages easier than DFAs NFA](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-50.jpg)
![Formal Definition of NFAs Set of states, i. e. Input aplhabet, i. e. Transition Formal Definition of NFAs Set of states, i. e. Input aplhabet, i. e. Transition](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-51.jpg)
![Transition Function resulting states with following one transition with symbol 52 Transition Function resulting states with following one transition with symbol 52](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-52.jpg)
![53 53](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-53.jpg)
![54 54](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-54.jpg)
![55 55](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-55.jpg)
![56 56](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-56.jpg)
![Extended Transition Function Same with but applied on strings 57 Extended Transition Function Same with but applied on strings 57](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-57.jpg)
![58 58](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-58.jpg)
![59 59](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-59.jpg)
![Special case: for any state 60 Special case: for any state 60](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-60.jpg)
![In general : there is a walk from with label to 61 In general : there is a walk from with label to 61](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-61.jpg)
![The Language of an NFA The language accepted by is: where and there is The Language of an NFA The language accepted by is: where and there is](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-62.jpg)
![63 63](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-63.jpg)
![64 64](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-64.jpg)
![65 65](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-65.jpg)
![66 66](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-66.jpg)
![67 67](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-67.jpg)
![68 68](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-68.jpg)
![NFAs accept the Regular Languages 69 NFAs accept the Regular Languages 69](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-69.jpg)
![Equivalence of Machines Definition: Machine is equivalent to machine if 70 Equivalence of Machines Definition: Machine is equivalent to machine if 70](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-70.jpg)
![Example of equivalent machines NFA DFA 71 Example of equivalent machines NFA DFA 71](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-71.jpg)
![Theorem: Languages accepted by NFAs Regular Languages accepted by DFAs NFAs and DFAs have Theorem: Languages accepted by NFAs Regular Languages accepted by DFAs NFAs and DFAs have](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-72.jpg)
![Proof: we only need to show Languages accepted by NFAs Regular Languages AND Languages Proof: we only need to show Languages accepted by NFAs Regular Languages AND Languages](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-73.jpg)
![Proof-Step 1 Languages accepted by NFAs Regular Languages Every DFA is trivially an NFA Proof-Step 1 Languages accepted by NFAs Regular Languages Every DFA is trivially an NFA](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-74.jpg)
![Proof-Step 2 Languages accepted by NFAs Regular Languages Any NFA can be converted to Proof-Step 2 Languages accepted by NFAs Regular Languages Any NFA can be converted to](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-75.jpg)
![Conversion NFA to DFA NFA DFA 76 Conversion NFA to DFA NFA DFA 76](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-76.jpg)
![NFA DFA 77 NFA DFA 77](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-77.jpg)
![empty set NFA DFA trap state 78 empty set NFA DFA trap state 78](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-78.jpg)
![NFA union DFA 79 NFA union DFA 79](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-79.jpg)
![NFA union DFA 80 NFA union DFA 80](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-80.jpg)
![NFA DFA trap state 81 NFA DFA trap state 81](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-81.jpg)
![END OF CONSTRUCTION NFA DFA 82 END OF CONSTRUCTION NFA DFA 82](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-82.jpg)
![General Conversion Procedure Input: an NFA Output: an equivalent DFA with 83 General Conversion Procedure Input: an NFA Output: an equivalent DFA with 83](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-83.jpg)
![The NFA has states The DFA has states from the power set 84 The NFA has states The DFA has states from the power set 84](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-84.jpg)
![Conversion Procedure Steps step 1. Initial state of NFA: Initial state of DFA: 85 Conversion Procedure Steps step 1. Initial state of NFA: Initial state of DFA: 85](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-85.jpg)
![Example NFA DFA 86 Example NFA DFA 86](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-86.jpg)
![step 2. For every DFA’s state compute in the NFA Union add transition to step 2. For every DFA’s state compute in the NFA Union add transition to](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-87.jpg)
![Example NFA DFA 88 Example NFA DFA 88](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-88.jpg)
![step 3. Repeat Step 2 for every state in DFA and symbols in alphabet step 3. Repeat Step 2 for every state in DFA and symbols in alphabet](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-89.jpg)
![Example NFA DFA 90 Example NFA DFA 90](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-90.jpg)
![step 4. For any DFA state if some is accepting state in NFA Then, step 4. For any DFA state if some is accepting state in NFA Then,](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-91.jpg)
![Example NFA DFA 92 Example NFA DFA 92](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-92.jpg)
![Lemma: If we convert NFA to DFA then the two automata are equivalent: Proof: Lemma: If we convert NFA to DFA then the two automata are equivalent: Proof:](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-93.jpg)
![First we show: We only need to prove: 94 First we show: We only need to prove: 94](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-94.jpg)
![NFA Consider symbols 95 NFA Consider symbols 95](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-95.jpg)
![symbol denotes a possible sub-path like symbol 96 symbol denotes a possible sub-path like symbol 96](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-96.jpg)
![We will show that if NFA then DFA state label 97 We will show that if NFA then DFA state label 97](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-97.jpg)
![More generally, we will show that if in : (arbitrary string) NFA then DFA More generally, we will show that if in : (arbitrary string) NFA then DFA](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-98.jpg)
![Proof by induction on Induction Basis: NFA DFA is true by construction of 99 Proof by induction on Induction Basis: NFA DFA is true by construction of 99](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-99.jpg)
![Induction hypothesis: Suppose that the following hold NFA DFA 100 Induction hypothesis: Suppose that the following hold NFA DFA 100](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-100.jpg)
![Induction Step: Then this is true by construction of NFA DFA 101 Induction Step: Then this is true by construction of NFA DFA 101](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-101.jpg)
![Therefore if NFA then DFA 102 Therefore if NFA then DFA 102](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-102.jpg)
![We have shown: With a similar proof we can show: Therefore: END OF LEMMA We have shown: With a similar proof we can show: Therefore: END OF LEMMA](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-103.jpg)
![ﺍﻟﻤﻤﻠﻜﺔ ﺍﻟﻌﺮﺑﻴﺔ ﺍﻟﺴﻌﻮﺩﻳﺔ ﻭﺯﺍﺭﺓ ﺍﻟﺘﻌﻠﻴﻢ ﺟﺎﻣﻌﺔ ﺃﻢ ﺍﻟﻘﺮﻯ ﺍﻟﻜﻠﻴﺔ ﺍﻟﺠﺎﻣﻌﻴﺔ ﺃﻀﻢ ﻗﺴﻢ ﺍﻟﺤﺎﺳﺐ ﺍﻟﻤﻤﻠﻜﺔ ﺍﻟﻌﺮﺑﻴﺔ ﺍﻟﺴﻌﻮﺩﻳﺔ ﻭﺯﺍﺭﺓ ﺍﻟﺘﻌﻠﻴﻢ ﺟﺎﻣﻌﺔ ﺃﻢ ﺍﻟﻘﺮﻯ ﺍﻟﻜﻠﻴﺔ ﺍﻟﺠﺎﻣﻌﻴﺔ ﺃﻀﻢ ﻗﺴﻢ ﺍﻟﺤﺎﺳﺐ](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-104.jpg)
- Slides: 104
![NonDeterministic Finite Automata 1 Non-Deterministic Finite Automata 1](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-1.jpg)
Non-Deterministic Finite Automata 1
![Nondeterministic Finite Automaton NFA Alphabet 2 Nondeterministic Finite Automaton (NFA) Alphabet = 2](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-2.jpg)
Nondeterministic Finite Automaton (NFA) Alphabet = 2
![Alphabet Two choices 3 Alphabet = Two choices 3](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-3.jpg)
Alphabet = Two choices 3
![Alphabet Two choices No transition 4 Alphabet = Two choices No transition 4](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-4.jpg)
Alphabet = Two choices No transition 4
![First Choice 5 First Choice 5](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-5.jpg)
First Choice 5
![First Choice 6 First Choice 6](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-6.jpg)
First Choice 6
![First Choice All input is consumed accept 7 First Choice All input is consumed “accept” 7](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-7.jpg)
First Choice All input is consumed “accept” 7
![Second Choice 8 Second Choice 8](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-8.jpg)
Second Choice 8
![Second Choice Input cannot be consumed Automaton Halts reject 9 Second Choice Input cannot be consumed Automaton Halts “reject” 9](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-9.jpg)
Second Choice Input cannot be consumed Automaton Halts “reject” 9
![An NFA accepts a string if there is a computation of the NFA that An NFA accepts a string: if there is a computation of the NFA that](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-10.jpg)
An NFA accepts a string: if there is a computation of the NFA that accepts the string i. e. , all the input string is processed and the automaton is in an accepting state 10
![is accepted by the NFA accept because this computation accepts reject this computation is is accepted by the NFA: “accept” because this computation accepts “reject” this computation is](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-11.jpg)
is accepted by the NFA: “accept” because this computation accepts “reject” this computation is ignored 11
![Rejection example 12 Rejection example 12](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-12.jpg)
Rejection example 12
![First Choice reject 13 First Choice “reject” 13](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-13.jpg)
First Choice “reject” 13
![Second Choice 14 Second Choice 14](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-14.jpg)
Second Choice 14
![Second Choice reject 15 Second Choice “reject” 15](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-15.jpg)
Second Choice “reject” 15
![Another Rejection example 16 Another Rejection example 16](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-16.jpg)
Another Rejection example 16
![First Choice 17 First Choice 17](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-17.jpg)
First Choice 17
![First Choice Input cannot be consumed reject Automaton halts 18 First Choice Input cannot be consumed “reject” Automaton halts 18](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-18.jpg)
First Choice Input cannot be consumed “reject” Automaton halts 18
![Second Choice 19 Second Choice 19](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-19.jpg)
Second Choice 19
![Second Choice Input cannot be consumed Automaton halts reject 20 Second Choice Input cannot be consumed Automaton halts “reject” 20](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-20.jpg)
Second Choice Input cannot be consumed Automaton halts “reject” 20
![An NFA rejects a string if there is no computation of the NFA that An NFA rejects a string: if there is no computation of the NFA that](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-21.jpg)
An NFA rejects a string: if there is no computation of the NFA that accepts the string. For each computation: • All the input is consumed and the automaton is in a non final state OR • The input cannot be consumed 21
![is rejected by the NFA reject All possible computations lead to rejection 22 is rejected by the NFA: “reject” All possible computations lead to rejection 22](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-22.jpg)
is rejected by the NFA: “reject” All possible computations lead to rejection 22
![is rejected by the NFA reject All possible computations lead to rejection 23 is rejected by the NFA: “reject” All possible computations lead to rejection 23](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-23.jpg)
is rejected by the NFA: “reject” All possible computations lead to rejection 23
![Language accepted 24 Language accepted: 24](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-24.jpg)
Language accepted: 24
![Lambda Transitions 25 Lambda Transitions 25](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-25.jpg)
Lambda Transitions 25
![26 26](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-26.jpg)
26
![27 27](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-27.jpg)
27
![input tape head does not move 28 input tape head does not move 28](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-28.jpg)
input tape head does not move 28
![all input is consumed accept String is accepted 29 all input is consumed “accept” String is accepted 29](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-29.jpg)
all input is consumed “accept” String is accepted 29
![Rejection Example 30 Rejection Example 30](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-30.jpg)
Rejection Example 30
![31 31](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-31.jpg)
31
![read head doesnt move 32 (read head doesn’t move) 32](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-32.jpg)
(read head doesn’t move) 32
![Input cannot be consumed Automaton halts reject String is rejected 33 Input cannot be consumed Automaton halts “reject” String is rejected 33](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-33.jpg)
Input cannot be consumed Automaton halts “reject” String is rejected 33
![Language accepted 34 Language accepted: 34](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-34.jpg)
Language accepted: 34
![Another NFA Example 35 Another NFA Example 35](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-35.jpg)
Another NFA Example 35
![36 36](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-36.jpg)
36
![37 37](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-37.jpg)
37
![accept 38 “accept” 38](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-38.jpg)
“accept” 38
![Another String 39 Another String 39](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-39.jpg)
Another String 39
![40 40](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-40.jpg)
40
![41 41](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-41.jpg)
41
![42 42](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-42.jpg)
42
![43 43](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-43.jpg)
43
![44 44](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-44.jpg)
44
![accept 45 “accept” 45](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-45.jpg)
“accept” 45
![Language accepted 46 Language accepted 46](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-46.jpg)
Language accepted 46
![Another NFA Example 47 Another NFA Example 47](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-47.jpg)
Another NFA Example 47
![Language accepted redundant state 48 Language accepted (redundant state) 48](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-48.jpg)
Language accepted (redundant state) 48
![Remarks The symbol never appears on the input tape Simple automata 49 Remarks: • The symbol never appears on the input tape • Simple automata: 49](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-49.jpg)
Remarks: • The symbol never appears on the input tape • Simple automata: 49
![NFAs are interesting because we can express languages easier than DFAs NFA • NFAs are interesting because we can express languages easier than DFAs NFA](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-50.jpg)
• NFAs are interesting because we can express languages easier than DFAs NFA DFA 50
![Formal Definition of NFAs Set of states i e Input aplhabet i e Transition Formal Definition of NFAs Set of states, i. e. Input aplhabet, i. e. Transition](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-51.jpg)
Formal Definition of NFAs Set of states, i. e. Input aplhabet, i. e. Transition function Initial state Accepting states 51
![Transition Function resulting states with following one transition with symbol 52 Transition Function resulting states with following one transition with symbol 52](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-52.jpg)
Transition Function resulting states with following one transition with symbol 52
![53 53](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-53.jpg)
53
![54 54](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-54.jpg)
54
![55 55](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-55.jpg)
55
![56 56](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-56.jpg)
56
![Extended Transition Function Same with but applied on strings 57 Extended Transition Function Same with but applied on strings 57](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-57.jpg)
Extended Transition Function Same with but applied on strings 57
![58 58](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-58.jpg)
58
![59 59](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-59.jpg)
59
![Special case for any state 60 Special case: for any state 60](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-60.jpg)
Special case: for any state 60
![In general there is a walk from with label to 61 In general : there is a walk from with label to 61](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-61.jpg)
In general : there is a walk from with label to 61
![The Language of an NFA The language accepted by is where and there is The Language of an NFA The language accepted by is: where and there is](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-62.jpg)
The Language of an NFA The language accepted by is: where and there is some (accepting state) 62
![63 63](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-63.jpg)
63
![64 64](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-64.jpg)
64
![65 65](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-65.jpg)
65
![66 66](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-66.jpg)
66
![67 67](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-67.jpg)
67
![68 68](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-68.jpg)
68
![NFAs accept the Regular Languages 69 NFAs accept the Regular Languages 69](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-69.jpg)
NFAs accept the Regular Languages 69
![Equivalence of Machines Definition Machine is equivalent to machine if 70 Equivalence of Machines Definition: Machine is equivalent to machine if 70](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-70.jpg)
Equivalence of Machines Definition: Machine is equivalent to machine if 70
![Example of equivalent machines NFA DFA 71 Example of equivalent machines NFA DFA 71](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-71.jpg)
Example of equivalent machines NFA DFA 71
![Theorem Languages accepted by NFAs Regular Languages accepted by DFAs NFAs and DFAs have Theorem: Languages accepted by NFAs Regular Languages accepted by DFAs NFAs and DFAs have](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-72.jpg)
Theorem: Languages accepted by NFAs Regular Languages accepted by DFAs NFAs and DFAs have the same computation power, accept the same set of languages 72
![Proof we only need to show Languages accepted by NFAs Regular Languages AND Languages Proof: we only need to show Languages accepted by NFAs Regular Languages AND Languages](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-73.jpg)
Proof: we only need to show Languages accepted by NFAs Regular Languages AND Languages accepted by NFAs Regular Languages 73
![ProofStep 1 Languages accepted by NFAs Regular Languages Every DFA is trivially an NFA Proof-Step 1 Languages accepted by NFAs Regular Languages Every DFA is trivially an NFA](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-74.jpg)
Proof-Step 1 Languages accepted by NFAs Regular Languages Every DFA is trivially an NFA Any language accepted by a DFA is also accepted by an NFA 74
![ProofStep 2 Languages accepted by NFAs Regular Languages Any NFA can be converted to Proof-Step 2 Languages accepted by NFAs Regular Languages Any NFA can be converted to](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-75.jpg)
Proof-Step 2 Languages accepted by NFAs Regular Languages Any NFA can be converted to an equivalent DFA Any language accepted by an NFA is also accepted by a DFA 75
![Conversion NFA to DFA NFA DFA 76 Conversion NFA to DFA NFA DFA 76](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-76.jpg)
Conversion NFA to DFA NFA DFA 76
![NFA DFA 77 NFA DFA 77](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-77.jpg)
NFA DFA 77
![empty set NFA DFA trap state 78 empty set NFA DFA trap state 78](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-78.jpg)
empty set NFA DFA trap state 78
![NFA union DFA 79 NFA union DFA 79](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-79.jpg)
NFA union DFA 79
![NFA union DFA 80 NFA union DFA 80](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-80.jpg)
NFA union DFA 80
![NFA DFA trap state 81 NFA DFA trap state 81](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-81.jpg)
NFA DFA trap state 81
![END OF CONSTRUCTION NFA DFA 82 END OF CONSTRUCTION NFA DFA 82](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-82.jpg)
END OF CONSTRUCTION NFA DFA 82
![General Conversion Procedure Input an NFA Output an equivalent DFA with 83 General Conversion Procedure Input: an NFA Output: an equivalent DFA with 83](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-83.jpg)
General Conversion Procedure Input: an NFA Output: an equivalent DFA with 83
![The NFA has states The DFA has states from the power set 84 The NFA has states The DFA has states from the power set 84](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-84.jpg)
The NFA has states The DFA has states from the power set 84
![Conversion Procedure Steps step 1 Initial state of NFA Initial state of DFA 85 Conversion Procedure Steps step 1. Initial state of NFA: Initial state of DFA: 85](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-85.jpg)
Conversion Procedure Steps step 1. Initial state of NFA: Initial state of DFA: 85
![Example NFA DFA 86 Example NFA DFA 86](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-86.jpg)
Example NFA DFA 86
![step 2 For every DFAs state compute in the NFA Union add transition to step 2. For every DFA’s state compute in the NFA Union add transition to](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-87.jpg)
step 2. For every DFA’s state compute in the NFA Union add transition to DFA 87
![Example NFA DFA 88 Example NFA DFA 88](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-88.jpg)
Example NFA DFA 88
![step 3 Repeat Step 2 for every state in DFA and symbols in alphabet step 3. Repeat Step 2 for every state in DFA and symbols in alphabet](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-89.jpg)
step 3. Repeat Step 2 for every state in DFA and symbols in alphabet until no more states can be added in the DFA 89
![Example NFA DFA 90 Example NFA DFA 90](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-90.jpg)
Example NFA DFA 90
![step 4 For any DFA state if some is accepting state in NFA Then step 4. For any DFA state if some is accepting state in NFA Then,](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-91.jpg)
step 4. For any DFA state if some is accepting state in NFA Then, is accepting state in DFA 91
![Example NFA DFA 92 Example NFA DFA 92](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-92.jpg)
Example NFA DFA 92
![Lemma If we convert NFA to DFA then the two automata are equivalent Proof Lemma: If we convert NFA to DFA then the two automata are equivalent: Proof:](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-93.jpg)
Lemma: If we convert NFA to DFA then the two automata are equivalent: Proof: We only need to show: AND 93
![First we show We only need to prove 94 First we show: We only need to prove: 94](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-94.jpg)
First we show: We only need to prove: 94
![NFA Consider symbols 95 NFA Consider symbols 95](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-95.jpg)
NFA Consider symbols 95
![symbol denotes a possible subpath like symbol 96 symbol denotes a possible sub-path like symbol 96](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-96.jpg)
symbol denotes a possible sub-path like symbol 96
![We will show that if NFA then DFA state label 97 We will show that if NFA then DFA state label 97](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-97.jpg)
We will show that if NFA then DFA state label 97
![More generally we will show that if in arbitrary string NFA then DFA More generally, we will show that if in : (arbitrary string) NFA then DFA](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-98.jpg)
More generally, we will show that if in : (arbitrary string) NFA then DFA 98
![Proof by induction on Induction Basis NFA DFA is true by construction of 99 Proof by induction on Induction Basis: NFA DFA is true by construction of 99](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-99.jpg)
Proof by induction on Induction Basis: NFA DFA is true by construction of 99
![Induction hypothesis Suppose that the following hold NFA DFA 100 Induction hypothesis: Suppose that the following hold NFA DFA 100](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-100.jpg)
Induction hypothesis: Suppose that the following hold NFA DFA 100
![Induction Step Then this is true by construction of NFA DFA 101 Induction Step: Then this is true by construction of NFA DFA 101](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-101.jpg)
Induction Step: Then this is true by construction of NFA DFA 101
![Therefore if NFA then DFA 102 Therefore if NFA then DFA 102](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-102.jpg)
Therefore if NFA then DFA 102
![We have shown With a similar proof we can show Therefore END OF LEMMA We have shown: With a similar proof we can show: Therefore: END OF LEMMA](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-103.jpg)
We have shown: With a similar proof we can show: Therefore: END OF LEMMA PROOF 103
![ﺍﻟﻤﻤﻠﻜﺔ ﺍﻟﻌﺮﺑﻴﺔ ﺍﻟﺴﻌﻮﺩﻳﺔ ﻭﺯﺍﺭﺓ ﺍﻟﺘﻌﻠﻴﻢ ﺟﺎﻣﻌﺔ ﺃﻢ ﺍﻟﻘﺮﻯ ﺍﻟﻜﻠﻴﺔ ﺍﻟﺠﺎﻣﻌﻴﺔ ﺃﻀﻢ ﻗﺴﻢ ﺍﻟﺤﺎﺳﺐ ﺍﻟﻤﻤﻠﻜﺔ ﺍﻟﻌﺮﺑﻴﺔ ﺍﻟﺴﻌﻮﺩﻳﺔ ﻭﺯﺍﺭﺓ ﺍﻟﺘﻌﻠﻴﻢ ﺟﺎﻣﻌﺔ ﺃﻢ ﺍﻟﻘﺮﻯ ﺍﻟﻜﻠﻴﺔ ﺍﻟﺠﺎﻣﻌﻴﺔ ﺃﻀﻢ ﻗﺴﻢ ﺍﻟﺤﺎﺳﺐ](https://slidetodoc.com/presentation_image_h2/af16e44125a1401584bf619e2d00f9c9/image-104.jpg)
ﺍﻟﻤﻤﻠﻜﺔ ﺍﻟﻌﺮﺑﻴﺔ ﺍﻟﺴﻌﻮﺩﻳﺔ ﻭﺯﺍﺭﺓ ﺍﻟﺘﻌﻠﻴﻢ ﺟﺎﻣﻌﺔ ﺃﻢ ﺍﻟﻘﺮﻯ ﺍﻟﻜﻠﻴﺔ ﺍﻟﺠﺎﻣﻌﻴﺔ ﺃﻀﻢ ﻗﺴﻢ ﺍﻟﺤﺎﺳﺐ ﺍﻵﻠﻲ Kingdom of Saudi Arabia Ministry of Education Umm Al. Qura University Adam University College Computer Science Department This Summary is an Online Content from this Book: Michael Sipser, Introduction to the Theory of Computation, 2 nd. Edition It is edited for Computation Theory Course 68034153 by: T. Mariah Sami Khayat Teacher Assistant @ Adam University College For Contacting: mskhayat@uqu. edu. sa 104
Finite automation
Gtg stands for in automata
Pda vs npda
Dfa stands for in automata
Deterministic finite automaton
Fsa diagram
Finite automata
Lambda closure nfa
Theory of computation
Finite state automata (fsa) adalah
Finite automata
Csc3130
Finite alphabet
Informal picture of finite automata
Lexical analysis finite automata
Deterministic finite state automata
Kleene theorem in automata
Finite automata with epsilon transitions
Contoh soal dan jawaban teori bahasa dan automata
Tata bahasa reguler
Dfa diagram generator
Gambarlah diagram transisi untuk nfa berikut
Mesin mealy
Automata
Limitations of finite automata
Convert nfa to dfa
Lba in automata
Nondeterministic
Non-deterministic turing machine
Hybrid automaton
Push down automata adalah
Suffix automaton
Fused relative clause
Finite and non finite
What is finite verb
Learning objectives for finite and non finite verbs
Finite and non finite verb
Re to nfa
Nfa vs pda
Nfa to fa
An nfa’s transition function returns
Dfa to nfa
Nfa vs dfa
Ekuivalensi nfa dan dfa
Nfa basic
Nfa to dfa
Dfa for (a/b)*abb
Nfa and ffa merge
E move
Contoh soal dfa yang ekuivalen dengan nfa
Dfa and nfa
Ffa history timeline
Transition diagram for relational operators
Vending machine c#
Dari sebuah mesin nfa dapat dibuat mesin dfa yang
Nfa theory of computation
Nfa to fa
Nfa to dfa conversion solved examples
Dfadfa
Nfa dfa equivalence
Definition of nfa
Automata
Nfa dengan e-move
Nfa to dfa
Contoh soal nfa dan jawabannya
Subset construction
Nfa
Convert nfa to dfa
Regular expression to nfa
Nfa text search
Construction of epsilon nfa from regular expression
Dfa vs nfa
Nfa audit
Regular expression to nfa
Nfa to dfa subset construction method
Mealy model
Automata szabászat
Pda for balanced parentheses
Automata
Pushdown automata
Formal languages and automata theory tutorial
Cfg simplification
Micron automata
Automata theory
Pushdown automata
Linear bounded automata
Wcw^r pda
Bidirectional transducers in automata theory
Automata
-dot
Cfg automata
Invatare automata
Push down automata (pda) didefinisikan dengan
Nia automata
Ekspresi reguler adalah
Formal languages and automata theory tutorial
Automata diagram
Expresiones regulares autómatas ejercicios resueltos
Contoh soal regular expression
Useless production in automata
Npda automata
History of buchi
Automata theory stanford
Automata-based programming
Recursive language in automata