On state reduction of incompletely specified finite state machines

Computers and Electrical Engineering

Volumn 33, Issue 1, 2007, Pages 58-69

  Gören, Sezer ^a   Ferguson, F Joel ^b  

^a BAHCESEHIR UNIVERSITY   (Turkey)

^b University of California Santa Cruz   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; OPTIMIZATION;

CIRCUIT DESIGN; FINITE STATE MACHINES; STATE REDUCTION;

FINITE AUTOMATA;

EID: 33750691667     PISSN: 00457906     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.compeleceng.2006.06.001     Document Type: Article

References (15)

1. Huffmann D.A. The synthesis of sequential switching circuits. J Franklin Institute 257 (1954) 161-190
2. Hopcroft JE. NlogN algorithm for minimizing states in finite automata. Tech Rep, Stanford University 1971; CS 71/190.
3. Pfleeger C.F. State reduction in incompletely specified finite state machines. IEEE Trans Comput 22 (1973) 1099-1102
4. Paull M.C., and Unger S.H. Minimizing the number of states in incompletely specified sequential switching functions. IRE Trans Electron Comput 8 (1959) 356-367
5. Luccio F. Extending the definition of prime compatibility classes of states in incompletely specified flow tables with the help of prime closed sets. IEEE Trans Electron Comput (1969) 953-956
6. Rho J.-K., Hachtel G., Somenzi F., and Jacoby R. Exact and heuristic algorithms for the minimization of incompletely specified finite state machines. IEEE Trans Comput Aided Des 13 (1994) 167-177
7. Ahmad I., and Das A.S. A heuristic algorithm for minimization of incompletely specified finite state machines. Comput Electric Eng 27 (2001) 159-172
8. Higuchi H., and Matsunaga Y. A fast state reduction algorithm for incompletely specified finite state machines. Des Automat Conf (1996) 463-466
9. Kam T., Villa T., Brayton R., and Sangiovanni-Vincentelli A. Synthesis of FSMs: functional optimization (1997), Kluwer Academic Publishers
10. Pena J.G., and Oliveira A.L. A new algorithm for exact reduction of incompletely specified finite state machines. IEEE Trans Comput Aided Des 18 (1999) 619-632
11. Biermann A.W., and Feldman J.A. On the synthesis of finite state machines from samples of their behavior. IEEE Trans Comput 21 (1972) 592-597
12. Angluin D. Learning regular sets from queries and counter examples. Inform Comput 75 (1987) 87-106
13. Gören S., and Ferguson F.J. Checking sequence generation for asynchronous sequential elements. Int Test Conference (1999) 406-413
14. Hennie F.C. Fault detecting experiments for sequential circuits. Int Symp Swit Circuit Theory Logic Des (1964) 95-110
15. Gören S., and Ferguson F.J. CHESMIN: a heuristic for state reduction in incompletely specified finite state machines. IEEE/ACM Des Automat Test Confer Europe (2002) 248-254