|
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 .
|
|
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 .
|
Ask your Facebook Friends
|
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.
|
|
This does not include a finite-state machine you might have done for college.
I want to know who has had to create one and why?
What was the most difficult aspect of creating the machine?
Started by David Basarab on
, 6 posts
by 6 people.
Answer Snippets (Read the full thread at stackoverflow):
Creating such machines is not difficult....
Other personal uses have been in GUI designs where the FSA has controlled the flow of interaction with the user .
Basically, I had to implement lexical analyzers manually for performance reasons .
Yes, lots of them.
|
|
I want to write something that will draw finite state automata. Does anyone know any algorithms that are related to this?
EDIT: I should mention that I know about graphviz. I want to build my own draw program/function, so what I'm looking for is some ...
Started by Sam Lee on
, 4 posts
by 4 people.
Answer Snippets (Read the full thread at stackoverflow):
It has a binary called fstdraw , which will output a finite-state machine in a format that can be read by dot ..
OpenFst convenient, a general toolkit for finite-state machines.
|
|
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.
|
