Beefy Boxes and Bandwidth Generously Provided by pair Networks
Syntactic Confectionery Delight
 
PerlMonks  

Re: Re: Re: Re: Clunky parsing problem, looking for simple solution

by demerphq (Chancellor)
on Jun 19, 2002 at 13:08 UTC ( #175652=note: print w/replies, xml ) Need Help??


in reply to Re: Re: Re: Clunky parsing problem, looking for simple solution
in thread Clunky parsing problem, looking for simple solution

the academic computer world now calls small state machines Discrete Finite Automations or something

I think a lot of terms are used, this being one of them. Determinisitic Finite State Automata, Turing Machines, Finite State Machines, Finite Sate Automata, State Transition Machine are all terms ive seen.

Yves / DeMerphq
---
Writing a good benchmark isnt as easy as it might look.

  • Comment on Re: Re: Re: Re: Clunky parsing problem, looking for simple solution

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://175652]
help
Chatterbox?
[1nickt]: ... but not the last straw?
1nickt ducks
virtualsue will be sweeping/raking it up for days
[virtualsue]: I need to get some cat pics into my talk http://www.cat- lovers-only.com/ images/three-cat- burritos-to-go-500 .jpg
[holli]: put mine in :)
[holli]: instant cat fame

How do I use this? | Other CB clients
Other Users?
Others chilling in the Monastery: (14)
As of 2017-11-21 12:33 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    In order to be able to say "I know Perl", you must have:













    Results (300 votes). Check out past polls.

    Notices?