{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T19:07:04Z","timestamp":1754161624303,"version":"3.41.2"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2001,7,1]],"date-time":"2001-07-01T00:00:00Z","timestamp":993945600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2001,7,1]],"date-time":"2001-07-01T00:00:00Z","timestamp":993945600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Event Dynamic Systems"],"published-print":{"date-parts":[[2001,7]]},"DOI":"10.1023\/a:1011253122019","type":"journal-article","created":{"date-parts":[[2002,12,23]],"date-time":"2002-12-23T04:18:21Z","timestamp":1040617101000},"page":"211-234","source":"Crossref","is-referenced-by-count":5,"title":["Synthesis of Supervisors Using Learning Algorithm of Regular Languages"],"prefix":"10.1007","volume":"11","author":[{"given":"Kunihiko","family":"Hiraishi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"336271_CR1","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1016\/S0019-9958(78)90683-6","volume":"39","author":"D. Angluin","year":"1978","unstructured":"Angluin, D. 1978. On the complexity of minimum inference of regular sets. Information and Control 39: 337\u2013350.","journal-title":"Information and Control"},{"key":"336271_CR2","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0890-5401(87)90052-6","volume":"75","author":"D. Angluin","year":"1987","unstructured":"Angluin, D. 1987. Learning regular sets from queries and conterexamples. Information and Computation 75: 87\u2013106.","journal-title":"Information and Computation"},{"key":"336271_CR3","unstructured":"Clarke, E. M. 1999. Model Checking. The MIT Press."},{"key":"336271_CR4","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1006\/inco.1997.2648","volume":"138","author":"Y. Freund","year":"1997","unstructured":"Freund, Y., and Kearns, M. 1997. Efficient learning of typical finite automata from random walks. Information and Computation 138: 23\u201348.","journal-title":"Information and Computation"},{"key":"336271_CR5","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1007\/3-540-55179-4_32","volume":"575","author":"P. Godefroid","year":"1991","unstructured":"Godefroid, P., and Wolper, P. 1991. Using partial orders for the efficient verification of deadlock freedom and safety properties. Lecture Notes in Computer Science 575, Springer-Verlag: 332\u2013342. Gold, M. E. 1978. Complexity of automaton identification from given data. Information and Control 37: 302-320.","journal-title":"Lecture Notes in Computer Science"},{"key":"336271_CR6","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/S0304-3975(96)00224-1","volume":"174","author":"S. Kobayashi","year":"1997","unstructured":"Kobayashi, S., and Yokomori, T. 1997. Learning approximately regular languages with reversible languages. Theoretical Computer Science 174: 251\u2013257.","journal-title":"Theoretical Computer Science"},{"key":"336271_CR7","doi-asserted-by":"crossref","unstructured":"Kumar, R., and Garg, V. K. 1995. Modeling and Control of Logical Discrete Event Systems. Kluwer Academic Publishers.","DOI":"10.1007\/978-1-4615-2217-1"},{"key":"336271_CR8","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1023\/A:1022869011914","volume":"2","author":"N. Littlestone","year":"1988","unstructured":"Littlestone, N. 1988. Learning when irrelevant attributes abound: A new linear-threshold algorithm. Mach. Learning 2: 285\u2013318.","journal-title":"Mach. Learning"},{"key":"336271_CR9","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1006\/inco.1995.1070","volume":"118","author":"O. Maler","year":"1995","unstructured":"Maler, O., and Pnueli, A. 1995. On the learnability of infinitely regular sets. Information and Computation 118: 316\u2013326.","journal-title":"Information and Computation"},{"key":"336271_CR10","first-page":"279","volume":"255","author":"A. Mazurkiewics","year":"1986","unstructured":"Mazurkiewics, A. 1986. Trace theory. Lecture Notes in Computer Science 255, Springer-Verlag: 279\u2013324.","journal-title":"Lecture Notes in Computer Science"},{"key":"336271_CR11","doi-asserted-by":"crossref","first-page":"1099","DOI":"10.1109\/T-C.1973.223655","volume":"C22-12","author":"C. P. Pfleeger","year":"1973","unstructured":"Pfleeger, C. P. 1973. State reduction in incompletely specified finite-state machines. IEEE Trans. Comput. C22-12: 1099\u20131102.","journal-title":"IEEE Trans. Comput"},{"key":"336271_CR12","first-page":"430","volume":"40-1","author":"L. Pitt","year":"1993","unstructured":"Pitt, L., and Warmuth, M. K. 1993. The minimum consistent DFA problem cannot be approximated within any polynomial. J. Assoc. Comput. Mach. 40-1: 430\u2013467.","journal-title":"J. Assoc. Comput. Mach."},{"key":"336271_CR13","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1109\/5.21072","volume":"77-1","author":"P. J. Ramadge","year":"1989","unstructured":"Ramadge, P. J., and Wonham, W. M. 1989. The control of discrete event systems. Proc. IEEE 77-1: 81\u201398.","journal-title":"Proc. IEEE"},{"key":"336271_CR14","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1006\/inco.1993.1021","volume":"103-2","author":"R. L. Rivest","year":"1993","unstructured":"Rivest, R. L., and Shapire, R. E. 1993. Inference of finite automata using homing sequences. Information and Computation 103-2: 299\u2013347.","journal-title":"Information and Computation"},{"key":"336271_CR15","doi-asserted-by":"crossref","first-page":"1134","DOI":"10.1145\/1968.1972","volume":"27-11","author":"L. G. Valiant","year":"1984","unstructured":"Valiant, L. G. 1984. A theory of the learnable. Comm. ACM 27-11: 1134\u20131142.","journal-title":"Comm. ACM"},{"key":"336271_CR16","first-page":"492","volume":"483","author":"A. Valmali","year":"1990","unstructured":"Valmali, A. 1990. Stubborn sets for reduced state space generation. Lecture Notes in Computer Science 483, Springer-Verlag: 492\u2013515.","journal-title":"Lecture Notes in Computer Science"},{"key":"336271_CR17","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1080\/00207178608933613","volume":"44-2","author":"A. F. Vaz","year":"1986","unstructured":"Vaz, A. F., and Wonham, W. M. 1986. On supervisor reduction in discrete-event systems. Int. J. Control 44-2: 475\u2013491.","journal-title":"Int. J. Control"}],"container-title":["Discrete Event Dynamic Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1011253122019.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1011253122019\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1011253122019.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,29]],"date-time":"2025-07-29T04:19:38Z","timestamp":1753762778000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1011253122019"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,7]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2001,7]]}},"alternative-id":["336271"],"URL":"https:\/\/doi.org\/10.1023\/a:1011253122019","relation":{},"ISSN":["0924-6703","1573-7594"],"issn-type":[{"type":"print","value":"0924-6703"},{"type":"electronic","value":"1573-7594"}],"subject":[],"published":{"date-parts":[[2001,7]]}}}