Highly Influenced

# State Reduction in Incompletely Specified Finite-State Machines

@article{Pfleeger1973StateRI, title={State Reduction in Incompletely Specified Finite-State Machines}, author={Charles P. Pfleeger}, journal={IEEE Transactions on Computers}, year={1973}, volume={C-22}, pages={1099-1102} }

- Published 1973 in IEEE Transactions on Computers
DOI:10.1109/T-C.1973.223655

The problem of reducing the number of states in an arbitrary incompletely specified deterministic finite-state machine to k states (for a given k) has proven intractible to solution within "reasonable" time; most techniques seem to require exponential time. Two reduction techniques–state assignment to the DON'T CARE entries, and so-called "state splitting"–are investigated. For both of the techniques, the question, "Can I achieve an equivalent k state machine?" is shown to be polynomial… CONTINUE READING

Highly Cited

This paper has 76 citations. REVIEW CITATIONS

#### From This Paper

##### Topics from this paper.

42 Citations

0 References

Similar Papers

#### Citations

##### Publications citing this paper.

#### Citation Statistics

#### 77 Citations

Citations per Year

Semantic Scholar estimates that this publication has

**77**citations based on the available data.See our **FAQ** for additional information.