|
You can read this question where I ask about the best architecture for a machine application for a little back story, although it's not entirely necessary for helping me with this question.
My understanding (especially for implementation) of Finite State...
Started by Max Schmeling on
, 3 posts
by 3 people.
Answer Snippets (Read the full thread at stackoverflow):
One should not nest FSMs just to do nesting, but sometimes FSMs get quite large... .
Having the possibility to nest FSMs is a good thing .
In contrary.
More details here.
Nested state machines are a standard notion in UML, so this is not necessarily dumb .
|
|
Let be a field and let be the field of rational functions over . Let be an intermediate field, . Prove that is a finite extension.
Started by seba1985 on
, 5 posts
by 3 people.
Answer Snippets (Read the full thread at artofproblemsolving):
|
|
Let be 3 integers, odd, and define the sequence by , , , and for all positive integers we have
Prove that for all positive integers , and for all primes the number is divisible by .
Started by Valentin Vornicu on
, 12 posts
by 7 people.
Answer Snippets (Read the full thread at artofproblemsolving):
So, this year it seems that each THS comes with a super-... .
Maybe it's not important, but it's interesting, isn't it? This was a super-hard problem, a memorable one .
All I've managed to observe up until now is that , where are the roots of the equation .
|
Ask your Facebook Friends
|
Could someone point me to some good online material for finite automata theory? Wikipedia articles are very concise.
Started by dta on
, 4 posts
by 4 people.
Answer Snippets (Read the full thread at stackoverflow):
Http://lamsonproject.org/docs/introduction_to_finite_state_machines.html http://stackoverflow.com/questions/364193/what-are-finite-state-automata-and-why-should.
MIT Courseware looks good.
|
|
Can someone show me how to build a finite state machine that shows modulus 4 in binary?
Answer Snippets (Read the full thread at stackoverflow):
Well, a binary number mod 4 is going to be 0 if the last two bits are 00, so ... .
Once you know that, you'll know how many states your machine can have .
I'll leave you with this (big) hint: think about how many possible results you can have in modulus-4 .
|
|
What is the use of finite automata. And all the concepts that we study in the theory of computation. I've never seen their uses yet.
Started by nicky on
, 9 posts
by 8 people.
Answer Snippets (Read the full thread at stackoverflow):
They are the theoretical encounter are, in increasing order of power:
....
Finite automata are very useful for communication protocols and for matching strings against using a finite state automaton to implement a recursive descent parser.
|
|
Does a general proof exist for the equivalence of two (deterministic) finite state machines that always takes finite time? That is, given two FSMs, can you prove that given the same inputs they will always produce the same outputs without actually needing...
Started by sgibbons on
, 3 posts
by 3 people.
Answer Snippets (Read the full thread at stackoverflow):
Scrounging my memory: basically, there is a unique minimal DFA for a given DFA, and there is a minimization algorithm that always terminates... .
Look for Sipser's textbook on the subject, that's where I know of it from .
There is a proof, though I don't know it.
|
|
I've recently read about the boost::statechart library (finite state machines) and I loved the concept.
Does C# have a similar mechanism ? Or can it be implemented using a specific design pattern?
Started by Maciek on
, 6 posts
by 6 people.
Answer Snippets (Read the full thread at stackoverflow):
It is built on top of QuickGraph , so you get many graph-analysis .
finite state machine for .NET.
|
|
Are Finite State Machines generally considered as bad design in OOP ?
I hear that a lot. And, after I had to work on a really old, undocumented piece of C++ making use of it, I tend to agree. It was a pain to debug.
what about readability/maintainability...
Started by f4 on
, 7 posts
by 7 people.
Answer Snippets (Read the full thread at stackoverflow):
But....
Finite state machines is a finite state machine.
It also performs very well.
That finite state machines are much easier to debug than other ways of solving the same problems (problems techniques, to make things more readable.
|
|
Does anyone have a solution for a basic, compact Finite state machine/automata written in Objective-C code?
I am interested in reusable components so that the FSM have states added and actions defined that use reusable state classes.
Started by Brock Woolf on
, 3 posts
by 3 people.
Answer Snippets (Read the full thread at stackoverflow):
Http://code.google.com/p/state-machine/
If you wanted to try to port it, I....
In addition to the reusable components, the state machine itself can be defined in an array (as data), which makes it really easy to use .
Might be ported...
I did this in Java.
|
