Beefy Boxes and Bandwidth Generously Provided by pair Networks
go ahead... be a heretic
 
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?
[marto]: good grief, that's not fun, glad to hear all is as well as could be :)
[Corion]: marto: Yeah - their mother picked all three of them up at the kindergarden to then go to the hospital, and all three of them were well behaved, and all also were quite obedient when they came home, so they recognized the situation
[Corion]: Nice to see that the kids have some understanding of important things that happen and the appropriate behaviour :)

How do I use this? | Other CB clients
Other Users?
Others pondering the Monastery: (8)
As of 2016-12-08 09:25 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    On a regular basis, I'm most likely to spy upon:













    Results (137 votes). Check out past polls.