Beefy Boxes and Bandwidth Generously Provided by pair Networks
The stupid question is the question not asked
 
PerlMonks  

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

by jepri (Parson)
on Jun 17, 2002 at 21:56 UTC ( #175201=note: print w/ replies, xml ) Need Help??


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

I think the academic computer world now calls small state machines Discrete Finite Automations or something. I read about how to do it in a lecture series I pulled of the net. Available upon request, or google for it. The upshot was that it was an interesting way of approaching the problem. To me it sounds like you are flogging yourself unnecessarily, but each to his own :)

____________________
Jeremy
I didn't believe in evil until I dated it.


Comment on Re: Re: Re: Clunky parsing problem, looking for simple solution
Re: Re: Re: Re: Clunky parsing problem, looking for simple solution
by demerphq (Chancellor) on Jun 19, 2002 at 13:08 UTC
    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.

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://175201]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others surveying the Monastery: (6)
As of 2014-08-21 08:57 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    The best computer themed movie is:











    Results (128 votes), past polls