Regexp to finite state machines
 

Ok so I'm having difficulty understanding how to Take a regular expression and turn it into a finite state machine.. so heres a problem similar to the one I need to solve.. Say I have a machine that takes £1 coins, dispenses beer(£1) and water(£2) so the values for a regular expression...