Lecture 24 - Exercises
Part A - The Language
Accepted by an NFA
Consider the following NFA over alphabet \(\Sigma = \{a,b\}\):
Which of the following strings are accepted by this machine?
- aab
- bbb
- bab
- aaa
- abaa
- abbb
- aaaab
- Describe (informally, in English) the language accepted by this
machine.
Part B - NFA Design
Draw a diagram for an NFA that accepts each of the following
languages over the alphabet \(\{a,
b\}\).
- \(L = \{a\}\)
- \(L = \{w : w \text{ ends with }
ab\}\)
- \(L = \{w : w \text{ contains an odd
number of $a$'s or exactly two $b$'s}\}\)