A new algorithm for the reduction of incompletely specified finite state machines

ABSTRACT

No abstract available.

References

1. 1.D. Angluin. Learning regular sets from queries and counterexamples. Inform. Comput., 75(2):87-106, November 1987.
2. 2.A.W. Biermann and J. A. Feldman. On the synthesis of finitestate machines from samples of their behavior. IEEE Transactions on Computers, 21:592-597, June 1972.
3. 3.A.W. Biermann and F. E. Petry. Speeding up the synthesis of programs from traces. IEEE Trans. on Computers, C-24:122- 136, 1975.
4. 4.O. Coudert and J.C. Madre. New ideas for solving covering problems. In Proc. Design Automation Conference, pages 641- 646, June 1995.
5. 5.E.M. Gold. Complexity of automaton identification from given data. Inform. Control, 37:302-320, 1978.
6. 6.A. Grasselli and F. Luccio. A method for minimizing the number of internal states in incompletely specified sequential networks. IRE Transactions on Electronic Computers, EC- 14(3):350-359, June 1965.
7. 7.H. Higuchi and Y. Matsunaga. A fast state reduction algorithm for incompletely specified finite state machines. In Proc. Design Automation Conference, pages 463--466, New York, June 1996. ACM Press.
8. 8.J.E. Hopcroft. n log n algorithm for minimizing states in finite automata. Technical Report CS 71/190, Stanford Univiversity, 1971.
9. 9.T. Kam, T. Villa, R. Brayton, and A. S. Vincentelli. Synthesis of FSMs. functional optimization. Kluwer Academic Publishers, 1997.
10. 10.T. Kam, T. Villa, R. Brayton, and A. Sangiovanni Vincentelli. A fully implicit algorithm for exact state minimization. In Proc. Design Automation Conference, pages 684--690, 1994.
11. 11.K. J. Lang. Random DFA's can be approximately learned from sparse uniform examples. In Proc. 5th Annu. Wor~hop on Comput. Learning Theory, pages 45-52. ACM Press, New York, NY, 1992.
12. 12.K. J. Lang, B. A. Pearlmutter, and R. Price. Results of the Abbadingo One DFA learning competition and a new evidence driven state merging algorithm. In Fourth International Colloquhtra on Grammatical Inference (ICGI-98), Lecture Notes in Computer Science, 1998.
13. 13.Giovanni De Micheli. Synthesis and Optimization of Digital Circuits. McGraw-Hill, 1994.
14. 14.A.L. Oliveira and J. P. M. Silva. Efficient search techniques for the inference of minimum size finite automata. In Proceedings of the 1998 South American Symposium on String Processing and information Retrieval, Santa Cruz de La Sierra, Bolivia, September 1998. IEEE Computer Society Press.
15. 15.C. E Pfleeger. State reduction in incompletely specified finite state machines. IEEE Trans. Computers, C-22:1099-1102, 1973.
16. 16.J.-K. Rho, G. Hachtel, E Somenzi, and R. Jacoby. Exact and heuristic algorithms for the minimization of incompletely specified state machines. IEEE Transactions on Computer-Aided Design, 13(2):167-177, February 1994.

Index Terms

• Applied computing

  • Physical sciences and engineering

    • Engineering

• Mathematics of computing

  • Mathematical software

• Theory of computation

  • Formal languages and automata theory