{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:20:38Z","timestamp":1740097238384,"version":"3.37.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319341705"},{"type":"electronic","value":"9783319341712"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-34171-2_28","type":"book-chapter","created":{"date-parts":[[2016,5,30]],"date-time":"2016-05-30T02:34:18Z","timestamp":1464575658000},"page":"394-408","source":"Crossref","is-referenced-by-count":0,"title":["Prediction of Infinite Words with Automata"],"prefix":"10.1007","author":[{"given":"Tim","family":"Smith","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,5,31]]},"reference":[{"key":"28_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/978-3-319-11662-4_10","volume-title":"Algorithmic Learning Theory","author":"D Angluin","year":"2014","unstructured":"Angluin, D., Fisman, D.: Learning regular omega languages. In: Auer, P., Clark, A., Zeugmann, T., Zilles, S. (eds.) ALT 2014. LNCS, vol. 8776, pp. 125\u2013139. Springer, Heidelberg (2014)"},{"issue":"3","key":"28_CR2","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1145\/356914.356918","volume":"15","author":"D Angluin","year":"1983","unstructured":"Angluin, D., Smith, C.H.: Inductive inference: theory and methods. ACM Comput. Surv. 15(3), 237\u2013269 (1983). http:\/\/doi.acm.org\/10.1145\/356914.356918","journal-title":"ACM Comput. Surv."},{"issue":"1","key":"28_CR3","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1017\/S0269964800003685","volume":"9","author":"D Blackwell","year":"1995","unstructured":"Blackwell, D.: Minimax vs. Bayes prediction. Probab. Eng. Inf. Sci. 9(1), 53\u201358 (1995). http:\/\/journals.cambridge.org\/article_S0269964800003685","journal-title":"Probab. Eng. Inf. Sci."},{"issue":"2","key":"28_CR4","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/S0019-9958(75)90261-2","volume":"28","author":"L Blum","year":"1975","unstructured":"Blum, L., Blum, M.: Toward a mathematical theory of inductive inference. Inf. Control 28(2), 125\u2013155 (1975). http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0019995875902612","journal-title":"Inf. Control"},{"doi-asserted-by":"crossref","unstructured":"Broglio, A., Liardet, P.: Predictions with automata. In: Symbolic Dynamics and its Applications. Contemporary Mathematics, vol. 135, pp. 111\u2013124. American Mathematical Society (1992)","key":"28_CR5","DOI":"10.1090\/conm\/135\/1185084"},{"key":"28_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1007\/3-540-46033-0_4","volume-title":"Artificial Evolution","author":"U Cerruti","year":"2002","unstructured":"Cerruti, U., Giacobini et al., M., Liardet, P.: Prediction of binary sequences by evolving finite state machines. In: Collet, P., Fonlupt, C., Hao, J.-K., Lutton, E., Schoenauer, M. (eds.) EA 2001. LNCS, vol. 2310, pp. 42\u201353. Springer, Heidelberg (2002)"},{"issue":"3","key":"28_CR7","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1145\/2493252.2493257","volume":"5","author":"A Drucker","year":"2013","unstructured":"Drucker, A.: High-confidence predictions under adversarial uncertainty. TOCT 5(3), 12 (2013). http:\/\/doi.acm.org\/10.1145\/2493252.2493257","journal-title":"TOCT"},{"unstructured":"Endrullis, J., Hendriks, D., Klop, J.W.: Degrees of streams. In: Integers, Electronic Journal of Combinatorial Number Theory 11B(A6), 1\u201340. 2010 Proceedings of the Leiden Numeration Conference (2011)","key":"28_CR8"},{"key":"28_CR9","doi-asserted-by":"crossref","first-page":"1258","DOI":"10.1109\/18.144706","volume":"38","author":"M Feder","year":"1992","unstructured":"Feder, M., Merhav, N., Gutman, M.: Universal prediction of individual sequences. IEEE Trans. Inf. Theory 38, 1258\u20131270 (1992)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"28_CR10","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1145\/321386.321403","volume":"14","author":"S Ginsburg","year":"1967","unstructured":"Ginsburg, S., Greibach, S.A., Harrison, M.A.: One-way stack automata. J. ACM 14(2), 389\u2013418 (1967)","journal-title":"J. ACM"},{"issue":"5","key":"28_CR11","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1016\/S0019-9958(67)91165-5","volume":"10","author":"EM Gold","year":"1967","unstructured":"Gold, E.M.: Language identification in the limit. Inf. Control 10(5), 447\u2013474 (1967). http:\/\/groups.lis.illinois.edu\/amag\/langev\/paper\/gold67limit.html","journal-title":"Inf. Control"},{"unstructured":"Hibbard, B.: Adversarial sequence prediction. In: Proceedings of the 2008 Conference on Artificial General Intelligence 2008: Proceedings of the First AGI Conference. pp. 399\u2013403. IOS Press, Amsterdam, The Netherlands (2008). http:\/\/dl.acm.org\/citation.cfm?id=1566174.1566212","key":"28_CR12"},{"issue":"1\u20132","key":"28_CR13","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/j.tcs.2010.08.024","volume":"412","author":"M Holzer","year":"2011","unstructured":"Holzer, M., Kutrib, M., Malcher, A.: Complexity of multi-head finite automata: origins and directions. Theor. Comput. Sci. 412(1\u20132), 83\u201396 (2011)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"28_CR14","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1007\/BF00290734","volume":"19","author":"J Hromkovi\u010d","year":"1983","unstructured":"Hromkovi\u010d, J.: One-way multihead deterministic finite automata. Acta Informatica 19(4), 377\u2013384 (1983). http:\/\/dx.doi.org\/10.1007\/BF00290734","journal-title":"Acta Informatica"},{"issue":"3","key":"28_CR15","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1007\/BF01941135","volume":"28","author":"P Johansen","year":"1988","unstructured":"Johansen, P.: Inductive inference of ultimately periodic sequences. BIT Numer. Math. 28(3), 573\u2013580 (1988). http:\/\/dx.doi.org\/10.1007\/BF01941135","journal-title":"BIT Numer. Math."},{"key":"28_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BFb0026598","volume-title":"Artificial Evolution","author":"B Leblanc","year":"1998","unstructured":"Leblanc, B., Lutton, E., Allouche, J.-P.: Inverse problems for finite automata: a solution based on genetic algorithms. In: Hao, J.-K., Lutton, E., Ronald, E., Schoenauer, M., Snyers, D. (eds.) AE 1997. LNCS, vol. 1363, pp. 157\u2013166. Springer, Heidelberg (1998)"},{"key":"28_CR17","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1007\/11894841_23","volume-title":"Algorithmic Learning Theory","author":"S Legg","year":"2006","unstructured":"Legg, S.: Is there an elegant universal theory of prediction? In: Balc\u00e1zar, J.L., Long, P.M., Stephan, F. (eds.) ALT 2006. LNCS (LNAI), vol. 4264, pp. 274\u2013287. Springer, Heidelberg (2006)"},{"issue":"3","key":"28_CR18","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1016\/0022-0000(88)90011-6","volume":"37","author":"MG O\u2019Connor","year":"1988","unstructured":"O\u2019Connor, M.G.: An unpredictability approach to finite-state randomness. J. Comput. Syst. Sci. 37(3), 324\u2013336 (1988). http:\/\/dx.doi.org\/10.1016\/0022-0000(88)90011-6","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"28_CR19","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1137\/0211030","volume":"11","author":"R Sedgewick","year":"1982","unstructured":"Sedgewick, R., Szymanski, T.G., Yao, A.C.: The complexity of finding cycles in periodic functions. SIAM J. Comput. 11(2), 376\u2013390 (1982)","journal-title":"SIAM J. Comput."},{"doi-asserted-by":"crossref","unstructured":"Shubert, B.: Games of prediction of periodic sequences. Technical report, United States Naval Postgraduate School (1971)","key":"28_CR20","DOI":"10.21236\/AD0733434"},{"unstructured":"Smith, T.: On infinite words determined by stack automata. In: FSTTCS 2013. Leibniz International Proceedings in Informatics (LIPIcs), vol. 24, pp. 413\u2013424. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany (2013)","key":"28_CR21"},{"issue":"1","key":"28_CR22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0019-9958(64)90223-2","volume":"7","author":"R Solomonoff","year":"1964","unstructured":"Solomonoff, R.: A formal theory of inductive inference. part i. Inf. Control 7(1), 1\u201322 (1964). http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0019995864902232","journal-title":"Inf. Control"},{"unstructured":"Wagner, K., Wechsung, G.: Computational complexity. Mathematics and its Applications. Springer (1986)","key":"28_CR23"}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-34171-2_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,8]],"date-time":"2019-09-08T21:14:13Z","timestamp":1567977253000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-34171-2_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319341705","9783319341712"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-34171-2_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}