Convert the following regular expressions to deterministic finite automata, using algorithms 3.23 and 3.20: a) (a|b)*.  b) (a*|b*)*.  c) ((e|a)b*)*.  d) (a|b)*abb(a|b)*. Suppose we have two tokens:...

Convert the following regular expressions to deterministic finite automata, using algorithms 3.23 and 3.20:


a) (a|b)*.

b) (a*|b*)*.

c) ((e|a)b*)*.

d) (a|b)*abb(a|b)*.

Suppose we have two tokens: (1) the keyword if, and (2) identifiers, which are strings of letters other than if. Show:


a) The NFA for these tokens, and

b) The DFA for these tokens.