[Discuss] Regular expressions and Boolean logic

[Lloyd Budd]

On 7/16/07, Daniel M German <dmgerman at uvic.ca> wrote:
> It is possible to build regular expressions by using Finite State
> machines (for any regular expression there exists a FSM that accepts
> the same language). This is kind of an ugly example, but it is
> doable.

When I first learnt about FSM I thought I was learning computer
history, but still 10 years later, whenever I am faced with a tricky
string to match I at least mentally construct a FSM.

-- 
I can't grow without light,
Lloyd
http://foolswisdom.com/