|generic state machine transaltion algorithm firstname.lastname@example.org (2004-09-21)|
|Re: generic state machine transaltion algorithm cfc@shell01.TheWorld.com (Chris F Clark) (2004-09-24)|
|Re: generic state machine transaltion algorithm wyderskiREMOVE@ii.uni.wroc.pl (Piotr Wyderski) (2004-10-02)|
|Date:||21 Sep 2004 22:23:37 -0400|
|Posted-Date:||21 Sep 2004 22:23:37 EDT|
There is generic algorithm for translating between state machines so
that programs that used to run on one state machine can be run on
another via this translation process. Assuming both machines are
relatively simple and well defined. So far as I know, all such
processes are manual and non automatic. Is there any theory, or some
one might have found a way to do it? Thanks.
Return to the
Search the comp.compilers archives again.