{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T14:17:20Z","timestamp":1761488240867},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1998,3,1]],"date-time":"1998-03-01T00:00:00Z","timestamp":888710400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["NGCO"],"published-print":{"date-parts":[[1998,3]]},"DOI":"10.1007\/bf03037319","type":"journal-article","created":{"date-parts":[[2009,4,22]],"date-time":"2009-04-22T02:00:42Z","timestamp":1240365642000},"page":"23-53","source":"Crossref","is-referenced-by-count":3,"title":["Automata for learning sequential tasks"],"prefix":"10.1007","volume":"16","author":[{"given":"C. H. Ben","family":"Choi","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"BF03037319_CR1","doi-asserted-by":"crossref","unstructured":"Angluin, D., \u201cA Note on the Number of Queries Needed to Identify Regular Languages,\u201dInformation and Control, 1981.","DOI":"10.1016\/S0019-9958(81)90090-5"},{"key":"BF03037319_CR2","doi-asserted-by":"crossref","unstructured":"Anglui. D., \u201cLearning Regular Sets from Queries and Counter Examples,\u201dInformation and Computation, 1987.","DOI":"10.1016\/0890-5401(87)90052-6"},{"issue":"3","key":"BF03037319_CR3","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1145\/356914.356918","volume":"15","author":"D. Angluin","year":"1983","unstructured":"Angluin, D., and Smith, C. H., \u201cInductive Inference: Theory and Methods,\u201dComputing Surveys, 15, 3, pp. 237\u2013269, 1983.","journal-title":"Computing Surveys"},{"key":"BF03037319_CR4","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1109\/TSMC.1985.6313371","volume":"3","author":"A. C. Barto","year":"1985","unstructured":"Barto, A. C. and Anandan, P., \u201cPattern-Recognizing Stochastic Learning Automata,\u201dIEEE Transactions on Systems, Man, and Cybernetics, SMC-15, 3, pp. 360\u2013375, May\/June 1 1985.","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics, SMC-15"},{"key":"BF03037319_CR5","unstructured":"Bengio, Y., Frasconi, P., and Simard, P., \u201cThe Problem of Learning Long-term Dependencies in Recurrent Networks,\u201dIEEE International Conference on Neural Networks, 1993."},{"key":"BF03037319_CR6","doi-asserted-by":"crossref","unstructured":"Bengio, Y., Simard, P., and Frasconi, P., \u201cLearning Long-term Dependencies with Gradient Descent is Difficult,\u201dIEEE Transactions on Neural Networks,5,2, March 1994.","DOI":"10.1109\/72.279181"},{"key":"BF03037319_CR7","doi-asserted-by":"crossref","unstructured":"Bianchini, M., Gori, M., and Maggini, M., \u201cOn the Problem of Local Minima in Recurrent Neural Networks,\u201dIEEE Transactions on Neural Networks,5,2, March 1994.","DOI":"10.1109\/72.279182"},{"key":"BF03037319_CR8","doi-asserted-by":"crossref","unstructured":"Biermann, A. W. and Feldman, J. A., \u201cOn the Synthesis of Finite-State Machines from Samples of Their Behavior,\u201dIEEE Transactions on Computers, pp. 592\u2013597, June 1972.","DOI":"10.1109\/TC.1972.5009015"},{"key":"BF03037319_CR9","unstructured":"Breeding, K. J., in communication with, Department of Electrical Engineering, The Ohio State University."},{"key":"BF03037319_CR10","unstructured":"Carbonell, J. (ed.),Machine Learning: Paradigms and Methods, MIT Press, 1990."},{"key":"BF03037319_CR11","unstructured":"Carroll, J. and Long, D.,Theory of Finite Automata with an Introduction to Formal Languages, Prentice-Hall, p. 13, p. 119, 1989."},{"key":"BF03037319_CR12","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.1109\/TNN.1994.8753425"},{"key":"BF03037319_CR13","doi-asserted-by":"crossref","unstructured":"Grasselli, A. and Luccio, F., \u201cA Method for Minimizing the Number of Internal States in Incompletely Specified Sequential Networks,\u201dIEEE Transactions on Electronic Computers, pp. 350\u2013359, 1965.","DOI":"10.1109\/PGEC.1965.264140"},{"key":"BF03037319_CR14","volume-title":"Neurocomputing","author":"R. Hecht-Nielsen","year":"1990","unstructured":"Hecht-Nielsen, R.,Neurocomputing, Addison-Wesley, Reading, Massachusetts, 1990."},{"key":"BF03037319_CR15","unstructured":"Ibarra, O. H. and Jiang, T., \u201cLearning Regular Languages from Counterexamples,\u201dProceedings of the 1988 Workshop on Computational Learning Theory, 1988."},{"key":"BF03037319_CR16","unstructured":"Jordan, M. I., \u201cAttractor Dynamics and Parallelism in Connectionist Sequential Machine,\u201dProceedings of the Eighth Annual Conference of the Cognitive Science Society, pp. 521\u2013545, 1986."},{"key":"BF03037319_CR17","unstructured":"Khanna, T.,Foundations of Neural Networks, Addison-Wesley, 1990."},{"key":"BF03037319_CR18","unstructured":"Kohavi, Z.,Switching and Finite Automata Theory, McGraw-Hil,, pp. 333\u2013347, 1978."},{"key":"BF03037319_CR19","doi-asserted-by":"crossref","unstructured":"Lanctot, K. and Oommen, B. J., \u201cDiscretized Estimator Learning Automata,\u201dIEEE Transactions on Systems, Man, and Cybernetics,22,6, November\/December 1992.","DOI":"10.1109\/21.199471"},{"key":"BF03037319_CR20","unstructured":"Marron, A., \u201cLearning Pattern Languages form a Single Initial Example and from Queries,\u201dProceedings of the 1988 Workshop on Computational Learning Theory, 1988."},{"key":"BF03037319_CR21","volume-title":"Explorations in Parallel Distributed Processing: A Handbook on Models, Programs, and Exercises","author":"J. L. McClelland","year":"1988","unstructured":"McClelland, J. L. and Rumelhart, D. E.,Explorations in Parallel Distributed Processing: A Handbook on Models, Programs, and Exercises, MIT Press, Cambridge, Massachusetts, 1988."},{"key":"BF03037319_CR22","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/5237.001.0001","volume-title":"Parallel Distributed Processing Explorations in the Microstructure of Cognition, Volume 2: Psychological and Biological Models","author":"J. L. McClelland","year":"1987","unstructured":"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."},{"key":"BF03037319_CR23","doi-asserted-by":"crossref","unstructured":"Meisel, W. S., \u201cA Note on Internal State Minimization in Incompletely Specified Sequential Networks,\u201dIEEE Transactions on Electronic Computers, pp. 508\u2013509, 1967.","DOI":"10.1109\/PGEC.1967.264674"},{"key":"BF03037319_CR24","doi-asserted-by":"crossref","unstructured":"Michalski, R. S., Carbonell, J. G., and Mitchell, T. M.,Machine Learning: An Artificial Intelligence Approach, Morgan Kaufmann, 1983.","DOI":"10.1007\/978-3-662-12405-5"},{"issue":"2","key":"BF03037319_CR25","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1177\/027836499101000205","volume":"10","author":"B. J. Oommen","year":"1991","unstructured":"Oommen, B. J., Andrade, N., Sitharam, I. S., \u201cTrajectory Planning of Robot Manipulators in Noisy Work Spaces Using Stochastic Automata,\u201dInternational Journal of Robotics Research, 10, 2, pp. 135\u2013148, 1991.","journal-title":"International Journal of Robotics Research"},{"key":"BF03037319_CR26","doi-asserted-by":"crossref","unstructured":"Pitt, L. and Warmuth, M. K., \u201cThe Minimum Consistent DFA Problem Cannot Be Approximated within Any Polynomial,\u201dProceedings of the 21 Annual ACM Symposium on Theory of Computing, pp. 421\u2013432, 1989.","DOI":"10.1109\/SCT.1989.41829"},{"key":"BF03037319_CR27","doi-asserted-by":"crossref","unstructured":"Porat, S. and Feldman, J. A., \u201cLearning Automata from Ordered Examples,\u201dProceedings of the 1988 Workshop on Computational Learning Theory, 1988, also onMachine Learning, 1991.","DOI":"10.1007\/978-1-4615-4008-3_2"},{"key":"BF03037319_CR28","doi-asserted-by":"crossref","unstructured":"Rivest, R., Schapire, L., and Robert, E., \u201cInference of Finite Automata Using Homing Sequences,\u201dProceedings of the Twenty First Annual ACM Symposium on Theory of Computing, pp. 411\u2013420, May 15\u201317, 1989.","DOI":"10.1145\/73007.73047"},{"issue":"3","key":"BF03037319_CR29","doi-asserted-by":"crossref","first-page":"424","DOI":"10.1109\/21.364856","volume":"25","author":"I. Rouvellou","year":"1995","unstructured":"Rouvellou, I. and Hart, G. W., \u201cInference of a Probabilistic Finite State Machine from Its Output,\u201dIEEE Transactions on Systems, Man, and Cybernetics, 25, 3, pp. 424\u2013437, March 1995.","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics"},{"key":"BF03037319_CR30","volume-title":"Parallel Distributed Processing: Explorations in the Microstructure of Cognition, Volume 1: Foundations","author":"D. E. Rumelhart","year":"1987","unstructured":"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."}],"container-title":["New Generation Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF03037319.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF03037319\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF03037319","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,4]],"date-time":"2021-10-04T10:33:00Z","timestamp":1633343580000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF03037319"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,3]]},"references-count":30,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1998,3]]}},"alternative-id":["BF03037319"],"URL":"https:\/\/doi.org\/10.1007\/bf03037319","relation":{},"ISSN":["0288-3635","1882-7055"],"issn-type":[{"value":"0288-3635","type":"print"},{"value":"1882-7055","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998,3]]}}}