Answer:
| String | Beed | ZZee | Dud | greed | FLEd | KNeed | MOON | Mooo |
|---|---|---|---|---|---|---|---|---|
| Match or Reject? |
Match | Match | Match | Reject | Reject | Match | Reject | Match |
| String | Beed | ZZee | Dud | greed | FLEd | KNeed | MOON | Mooo |
|---|---|---|---|---|---|---|---|---|
| Match or Reject? |
Match | Match | Match | Reject | Reject | Match | Reject | Match |
An automaton that accepts one or more instances of a character has a required
transition for that character to a state that has a loop for the character.
The above automaton is for [A-Z]+[aeiou]+[bd]?.
The automaton has two final states, q2 and q3. This is fine.
Write a RE for strings that start with one or more alphabetical characters, upper or lower case, followed by any number of alphanumeric characters, upper or lower case.