{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:35:50Z","timestamp":1725550550311},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540292425"},{"type":"electronic","value":"9783540316961"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11564089_15","type":"book-chapter","created":{"date-parts":[[2005,10,10]],"date-time":"2005-10-10T13:51:09Z","timestamp":1128952269000},"page":"171-182","source":"Crossref","is-referenced-by-count":7,"title":["Learnability of Probabilistic Automata via Oracles"],"prefix":"10.1007","author":[{"given":"Omri","family":"Guttman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S. V. N.","family":"Vishwanathan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert C.","family":"Williamson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"Batu, T., Fortnow, L., Rubinfeld, R., Smith, W.D., White, P.: Testing that distributions are close. In: Proc. 41\n                      st\n                     Annu. IEEE Sympos. Found. Comput. Sci. (FOCS), pp. 259\u2013269. IEEE Computer Society, Los Alamitos (2000)","DOI":"10.1109\/SFCS.2000.892113"},{"issue":"1","key":"15_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1051\/ita:1999102","volume":"33","author":"R.C. Carrasco","year":"1999","unstructured":"Carrasco, R.C., Oncina, J.: Learning deterministic regular grammars from stochastic samples in polynomial time. Theoret. Inform. and Appl.\u00a033(1), 1\u201320 (1999)","journal-title":"Theoret. Inform. and Appl."},{"key":"15_CR3","first-page":"473","volume":"5","author":"A. Clark","year":"2004","unstructured":"Clark, A., Thollard, F.: PAC-learnability of probabilistic deterministic finite state automata. Journal of Machine Learning Research\u00a05, 473\u2013497 (2004)","journal-title":"Journal of Machine Learning Research"},{"key":"15_CR4","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611","volume-title":"Elements of Information Theory","author":"T. Cover","year":"1991","unstructured":"Cover, T., Thomas, J.: Elements of Information Theory. Wiley, Chichester (1991)"},{"key":"15_CR5","volume-title":"Introduction to Automata Theory, Languages and Computation","author":"J.E. Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation, 1st edn. Addison-Wesley, Reading (1979)","edition":"1"},{"key":"15_CR6","first-page":"392","volume-title":"Proc. 25 th Annu. ACM Sympos. Theory Comput. (STOC)","author":"M. Kearns","year":"1993","unstructured":"Kearns, M.: Efficient noise-tolerant learning from statistical queries. In: Proc. 25\n                      th\n                     Annu. ACM Sympos. Theory Comput (STOC), pp. 392\u2013401. ACM Press, New York (1993)"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"Kearns, M., Mansour, Y., Ron, D., Rubinfeld, R., Schapire, R., Sellie, L.: On the learnability of discrete distributions. In: Proc. 26\n                      th\n                     Annu. ACM Sympos. Theory Comput (STOC), pp. 273\u2013282 (1994)","DOI":"10.1145\/195058.195155"},{"key":"15_CR8","unstructured":"Murphy, K.: Passively learning finite automata. Technical report, Santa Fe Institute (1996)"},{"key":"15_CR9","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1007\/978-1-4615-0013-1_15","volume-title":"Handbook of Randomized Computing","author":"D. Ron","year":"2001","unstructured":"Ron, D.: Property testing. In: Rajasekaran, S., Pardalos, P., Reif, J., Rolim, J. (eds.) Handbook of Randomized Computing, vol.\u00a0II, pp. 597\u2013649. Kluwer Academic, Dordrecht (2001)"},{"key":"15_CR10","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/225298.225302","volume-title":"Proc. 8 th Annu. Conf. on Comput. Learning Theory","author":"D. Ron","year":"1995","unstructured":"Ron, D., Singer, Y., Tishby, N.: On the learnability and usage of acyclic probabilistic finite automata. In: Proc. 8\n                      th\n                     Annu. Conf. on Comput. Learning Theory, pp. 31\u201340. ACM Press, New York (1995)"},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"Vidal, E., Thollard, F., de la Higuera, C., Casacuberta, F., Carrasco, R.C.: Probabilistic finite-state machines \u2013 Part I. IEEE Trans. Pattern Anal. Mach. Intell. (2005a) (to appear)","DOI":"10.1109\/TPAMI.2005.147"},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"Vidal, E., Thollard, F., de la Higuera, C., Casacuberta, F., Carrasco, R.C.: Probabilistic finite-state machines \u2013 Part II. IEEE Trans. Pattern Anal. Mach. Intell. (2005b) (to appear)","DOI":"10.1109\/TPAMI.2005.148"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11564089_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:15:16Z","timestamp":1619507716000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11564089_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540292425","9783540316961"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/11564089_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}