Problem
1. Give a regular expression for recognizing all occurrences of four or fewer consecutive l's in a binary string.
2. Draw the nondeterministic pattern-matching machine for the pattern description (A+B)•+C.
3. Give the state transitions your machine from the previous exercise would make to recognize ABBAC.
4. Explain how you would modify the nondeterministic machine to handle the not function.