Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

9

DATE
2002
IEEE

favoriteEmaildiscussreport

105views Hardware» more DATE 2002»

CHESMIN: A Heuristic for State Reduction in Incompletely Specified Finite State Machines

13 years 9 months ago

CHESMIN: A Heuristic for State Reduction in Incompletely Specified Finite State Machines

Download www.date-conference.com

Sezer Gören, F. Joel Ferguson

Real-time Traffic

DATE 2002 | Hardware |

claim paper

Related Content

» A Fast State Reduction Algorithm for Incompletely Specified Finite State Machines

» A new method for the state reduction of incompletely specified finite sequential machines

» A new partitioning scheme for improvement of image computation

» Synthia Synthesis of Interacting Automata Targeting LUTbased FPGAs

» Specification validation and verification of timecritical systems

» Architectural concepts and Design Patterns for behavior modeling and integration

Post Info
More Details (n/a)

Added	14 Jul 2010
Updated	14 Jul 2010
Type	Conference
Year	2002
Where	DATE
Authors	Sezer Gören, F. Joel Ferguson

Comments (0)