go ahead... be a heretic | |
PerlMonks |
Re: finite automataby VSarkiss (Monsignor) |
on Oct 05, 2001 at 00:42 UTC ( [id://116825]=note: print w/replies, xml ) | Need Help?? |
I have a guess about this. Nobody in the CB seemed to bite, so I'll repeat it here. ;-) The setting Professor: Finite state machines have many practical uses. One of them is for lexical analysis of a regular language. As a matter of fact, regular expressions are usually implemented as FSMs. Later Student: "Design a finite-state machine for a language that ..." ACK! I can't handle this. What did he say about Perl? Let's see.... And the rest you already know.
In Section
Meditations
|
|