Efficient search techniques for the inference of minimum size finite automata

Proceedings - String Processing and Information Retrieval: A South American Symposium, SPIRE 1998

Volumn 1998-September, Issue , 1998, Pages 81-89

  Oliveira, A L ^a   Silva, J P M ^a  

^a INSTITUTO SUPERIOR TÉCNICO   (Portugal)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION RETRIEVAL;

DETERMINISTIC AUTOMATA; INPUT/OUTPUT; ORDERS OF MAGNITUDE; SEARCH ALGORITHMS; SEARCH TECHNIQUE;

INFERENCE ENGINES;

EID: 84974725549     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SPIRE.1998.712986     Document Type: Conference Paper

References (24)

1. D. Angluin. On the complexity of minimum inference of regular sets. Inform. Control, 39(3): 337-350, 1978.
2. D. Angluin. Learning regular sets from queries and counterexamples. Inform. Comput., 75(2): 87-106, Nov. 1987.
3. A. W. Biermann and J. A. Feldman. On the synthesis of finite-state machines from samples of their behavior. IEEE Transactions on Computers, 21: 592-597, June 1972.
4. A. W. Biermann and F. E. Petry. Speeding up the synthesis of programs from traces. IEEE Trans. on Computers, C- 24: 122-136, 1975.
5. R. Carraghan and P. M. Pardalos. An exact algorithm for the maximum clique problem. Operations Research Letters, 9: 375-382, November 1990.
6. M. Davis and H. Putnam. A computing procedure for quantification theory. Journal of the Association for Computing Machinery, 7(3): 201-215, 1960.
7. J. de Kleer. An assumption-based TMS. Artificial Intelligence, 28(2): 127-162, Mar. 1986.
8. M. Garey and D. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York, 1979.
9. E. M. Gold. System identification via state characterization. Automatica, 8: 621-636, 1972.
10. E. M. Gold. Complexity of automaton identification from given data. Inform. Control, 37: 302-320, 1978.
11. J. N. Gray and M. A. Harrison. The theory of sequential relations. Information and Control, 9, 1966.
12. M. H. Kunz and D. K. Pradhan. Recursive learning: An attractive alternative to the decision tree for test generation in digital circuits. In Proceedings of the International Test Conference, pages 816-825, 1992.
13. K. J. Lang. Random DFA's can be approximately learned from sparse uniform examples. In Proc. 5th Annu.Workshop on Comput. Learning Theory, pages 45-52. ACM Press, New York, NY, 1992.
14. A. L. Oliveira. Inductive Learning by Selection of Minimal Complexity Representations. PhD thesis, UC Berkeley, December 1994. Also available as UCB/ERL Technical Report M94/97.
15. A. L. Oliveira and S. Edwards. Limits of exact algorithms for inference of minimum size finite state machines. In Proceedings of the Seventh Workshop on Algorithmic Learning Theory, number 1160 in Lecture Notes in Artificial Intelligence, pages 59-66, Sydney, Australia, Oct. 1996. Springer- Verlag.
16. C. F. Pfleeger. State reduction in incompletely specified finite state machines. IEEE Trans. Computers, C-22: 1099-1102, 1973.
17. L. Pitt and M. Warmuth. The minimum consistent DFA problem cannot be approximated within any polynomial. J. ACM, 40(1): 95-142, 1993.
18. S. Porat and J. A. Feldman. Learning automata from ordered examples. In Proc. 1st Annu. Workshop on Comput. Learning Theory, pages 386-396, San Mateo, CA, 1988. Morgan Kaufmann.
19. S. Russel and P. Norvig. Artificial Intelligence : A Modern Approach. Prentice-Hall, 1996.
20. R. E. Schapire. The Design and Analysis of Efficient Learning Algorithms. MIT Press, Cambridge, MA, 1992.
21. J. P. M. Silva. Search Algorithms for Satisfiability Problems in Combinational Switching Circuits. PhD thesis, University of Michigan, May 1995.
22. J. P. M. Silva and K. Sakallah. Grasp - A new search algorithm for satisfiability. In ICCAD, pages 220-227. IEEE Computer Society Press, 1996.
23. R. M. Stallman and G. J. Sussman. Forward reasoning and dependency-directed backtracking in a system for computeraided circuit analysis. Artificial Intelligence, 9: 135-196, 1977.
24. B. A. Trakhtenbrot and Y. M. Barzdin. Finite Automata. North-Holland, Amsterdam, 1973.