Come for the quick hacks, stay for the epiphanies. | |
PerlMonks |
Re: finite automataby pjf (Curate) |
on Oct 02, 2001 at 14:23 UTC ( [id://116093]=note: print w/replies, xml ) | Need Help?? |
So... you want to tell whether or not a string is composed entirely of the alphabet a-z? That's pretty easy with a regexp.
You mentioned finite automata in your subject line, though. Am I missing something else here? ;)
Cheers,
In Section
Seekers of Perl Wisdom
|
|