a, b b 1 2 3 (а)
This discussion has two parts. This nondeterministic finite automata (NFA) from the exercise at the end of chapter 3. Figure 3.37a. It has the specific nondeterminism we want to exhibit. Generate a unique string in the language accepted by the NFA with the following two properties:
1. The string is a minimum of 5 characters long.
2. The string forces a non-deterministic choice in the NFA. For example the NFA 3.37a has two transitions for 'a' from state 1:
So, a string in the language accepted by this NFA can force a nondeterministic choice if the NFA is currently in state 1 and 'a' is the next input character. So for example (which no one can use) the string 'bbaab' would drive the NFA to state 1 with the first 'a' as current input character, forcing a nondeterministic choice.
Once you have your NFA and your string to process. Generate a computation tree that shows the processing of your string by the NFA. Post your computation tree along with your NFA and the string you processed.
We take string:
aabaab
Below we give explanation:
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 1 images
