Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl: the Markov chain saw
 
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?
[Tux]: so, another app with gtk GUI had something similar, but it defined the IM_MODULE(s) as cedilla.
[Tux]: when I set QT_IM_MODULE and GTK_IM_MODULE both to c<xim> and *unset* XMODIFIERS, all works fantastic
Tux => $HOME
[Tanktalus]: great, now I'm going to have to convert html codes to text for display... :)

How do I use this? | Other CB clients
Other Users?
Others avoiding work at the Monastery: (12)
As of 2017-09-25 21:16 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    During the recent solar eclipse, I:









    Results (291 votes). Check out past polls.

    Notices?