Automata for learning sequential tasks

New Generation Computing

Volumn 16, Issue 1, 1998, Pages 023-054

  Choi, C H Ben ^a,b  

^a Ohio State University   (United States)

^b OHIO STATE UNIVERSITY   (United States)

Author keywords

Finite State Machines; Inference Mechanisms; Learning from Examples; Learning Sequential Tasks; Machine Learning

Indexed keywords

ALGORITHMS; COMBINATORIAL SWITCHING; LEARNING SYSTEMS; MATHEMATICAL MODELS; SEQUENTIAL MACHINES; SEQUENTIAL SWITCHING; VLSI CIRCUITS;

FINITE STATE MACHINES; LEARNING FROM EXAMPLES; LEARNING SEQUENTIAL TASKS;

FINITE AUTOMATA;

EID: 0031678474     PISSN: 02883635     EISSN: None     Source Type: Journal    
DOI: 10.1007/bf03037319     Document Type: Article

References (31)

1. Angluin, D., "A Note on the Number of Queries Needed to Identify Regular Languages," Information and Control, 1981.
2. Angluin. D., "Learning Regular Sets from Queries and Counter Examples," Information and Computation, 1987.
3. Angluin, D., and Smith, C. H., "Inductive Inference: Theory and Methods," Computing Surveys, 15, 3, pp. 237-269, 1983.
4. Barto, A. C. and Anandan, P., "Pattern-Recognizing Stochastic Learning Automata," IEEE Transactions on Systems, Man, and Cybernetics, SMC-15, 3, pp. 360-375, May/ June 1985.
5. Bengio, Y., Frasconi, P., and Simard, P., "The Problem of Learning Long-term Dependencies in Recurrent Networks," IEEE International Conference on Neural Networks, 1993.
6. Bengio, Y., Simard, P., and Frasconi, P., "Learning Long-term Dependencies with Gradient Descent is Difficult," IEEE Transactions on Neural Networks, 5, 2, March 1994.
7. Bianchini, M., Gori, M., and Maggini, M., "On the Problem of Local Minima in Recurrent Neural Networks," IEEE Transactions on Neural Networks, 5, 2, March 1994.
8. Biermann, A. W. and Feldman, J. A., "On the Synthesis of Finite-State Machines from Samples of Their Behavior," IEEE Transactions on Computers, pp. 592-597, June 1972.
9. Breeding, K. J., in communication with, Department of Electrical Engineering, The Ohio State University.
10. Carbonell, J. (ed.), Machine Learning: Paradigms and Methods, MIT Press, 1990.
11. Carroll, J. and Long, D., Theory of Finite Automata with an Introduction to Formal Languages, Prentice-Hall, p. 13, p. 119, 1989.
12. Giles, C. L., Kuhn, G. M., and Williams, R. J., Guest Editors, Special Issue on Dynamic Recurrent Neural Networks, IEEE Transactions on Neural Networks, 5, 2, March 1994.
13. Grasselli, A. and Luccio, F., "A Method for Minimizing the Number of Internal States in Incompletely Specified Sequential Networks," IEEE Transactions on Electronic Computers, pp. 350-359, 1965.
14. Hecht-Nielsen, R., Neurocomputing, Addison-Wesley, Reading, Massachusetts, 1990.
15. Ibarra, O. H. and Jiang, T., "Learning Regular Languages from Counterexamples," Proceedings of the 1988 Workshop on Computational Learning Theory, 1988.
16. Jordan, M. I., "Attractor Dynamics and Parallelism in Connectionist Sequential Machine," Proceedings of the Eighth Annual Conference of the Cognitive Science Society, pp. 521-545, 1986.
17. Khanna, T., Foundations of Neural Networks, Addison-Wesley, 1990.
18. Kohavi, Z., Switching and Finite Automata Theory, McGraw-Hill, pp. 333-347, 1978.
19. Lanctot, K. and Oommen, B. J., "Discretized Estimator Learning Automata," IEEE Transactions on Systems, Man, and Cybernetics, 22, 6, November/December 1992.
20. Marron, A., "Learning Pattern Languages form a Single Initial Example and from Queries," Proceedings of the 1988 Workshop on Computational Learning Theory, 1988.
21. McClelland, J. L. and Rumelhart, D. E., Explorations in Parallel Distributed Processing: A Handbook on Models, Programs, and Exercises, MIT Press, Cambridge, Massachusetts, 1988.
22. McClelland, J. L., Rumelhart, D. E., and the PDP Research Group, Parallel Distributed Processing Explorations in the Microstructure of Cognition, Volume 2: Psychological and Biological Models, MIT Press, Cambridge, Massachusetts, 1987.
23. Meisel, W. S., "A Note on Internal State Minimization in Incompletely Specified Sequential Networks," IEEE Transactions on Electronic Computers, pp. 508-509, 1967.
24. Michalski, R. S., Carbonell, J. G., and Mitchell, T. M., Machine Learning: An Artificial Intelligence Approach, Morgan Kaufmann, 1983.
25. Oommen, B. J., Andrade, N., Sitharam, I. S., "Trajectory Planning of Robot Manipulators in Noisy Work Spaces Using Stochastic Automata," International Journal of Robotics Research, 10, 2, pp. 135-148, 1991.
26. Pitt, L. and Warmuth, M. K., "The Minimum Consistent DFA Problem Cannot Be Approximated within Any Polynomial," Proceedings of the 21 Annual ACM Symposium on Theory of Computing, pp. 421-432, 1989.
27. Porat, S. and Feldman, J. A., "Learning Automata from Ordered Examples," Proceedings of the 1988 Workshop on Computational Learning Theory, 1988, also on Machine Learning, 1991.
28. Porat, S. and Feldman, J. A., "Learning Automata from Ordered Examples," Proceedings of the 1988 Workshop on Computational Learning Theory, 1988, also on Machine Learning, 1991.
29. Rivest, R., Schapire, L., and Robert, E., "Inference of Finite Automata Using Homing Sequences," Proceedings of the Twenty First Annual ACM Symposium on Theory of Computing, pp. 411-420, May 15-17, 1989.
30. Rouvellou, I. and Hart, G. W., "Inference of a Probabilistic Finite State Machine from Its Output," IEEE Transactions on Systems, Man, and Cybernetics, 25, 3, pp. 424-437, March 1995.
31. Rumelhart, D. E., McClelland, J. L., and the PDP Research Group, Parallel Distributed Processing: Explorations in the Microstructure of Cognition, Volume 1: Foundations, MIT Press, Cambridge, Massachusetts, 1987.