conference · 1998
A new algorithm for the reduction of incompletely specified finite state machines
See where this sits in the topic map →Summary AI-generated
- TL;DR
- We propose a new algorithm for state reduction in incompletely specified finite state machines that avoids enumerating compatible sets, making its performance independent of the number of prime compatibles.
- Problem
- Traditional approaches to state reduction rely on enumerating compatible sets, which can become inefficient or intractable on hard problems.
- Method
- We introduce a new algorithm for state reduction in incompletely specified finite state machines that does not rely on the enumeration of compatible sets.
- Results
- We present results showing that the proposed algorithm is much more efficient than both explicit and implicit approaches based on compatible set enumeration on a set of hard problems.
- Contributions
- We propose a new algorithm for state reduction and prove that it is exact.
- Limitations
- Not specified in the abstract.
- Takeaways
- The proposed algorithm is proven to be exact and demonstrates significantly higher efficiency than traditional compatible-set-based approaches on hard problems.
- Applications
- Not specified in the abstract.
- Topics
- Not specified in the abstract.
- For industry
- Not specified in the abstract.
- Why it matters
- Not specified in the abstract.
Abstract
We propose a new rdgorithm to the problem of state reduction in incompletely specified finite state machines. ~is algorithm is not based on the enumeration of compatible sets, and, therefore, its performance is not dependent on the number of prime compatibles. We prove that the algorithm is exact and present results that show that, in a set of hard problems, it is much more efficient than both the explicit and implicit approaches based on the enumeration of compatible sets.