{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T07:08:28Z","timestamp":1743145708492,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662531310"},{"type":"electronic","value":"9783662531327"}],"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-662-53132-7_14","type":"book-chapter","created":{"date-parts":[[2016,7,19]],"date-time":"2016-07-19T21:25:06Z","timestamp":1468963506000},"page":"164-176","source":"Crossref","is-referenced-by-count":4,"title":["Degrees of Infinite Words, Polynomials and Atoms"],"prefix":"10.1007","author":[{"given":"J\u00f6rg","family":"Endrullis","sequence":"first","affiliation":[]},{"given":"Juhani","family":"Karhum\u00e4ki","sequence":"additional","affiliation":[]},{"given":"Jan Willem","family":"Klop","sequence":"additional","affiliation":[]},{"given":"Aleksi","family":"Saarela","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,7,21]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511546563","volume-title":"Automatic Sequences: Theory, Applications Generalizations","author":"JP Allouche","year":"2003","unstructured":"Allouche, J.P., Shallit, J.: Automatic Sequences: Theory, Applications Generalizations. Cambridge University Press, New York (2003)"},{"issue":"3","key":"14_CR2","first-page":"451","volume":"42","author":"A Belov","year":"2008","unstructured":"Belov, A.: Some algebraic properties of machine poset of infinite words. ITA 42(3), 451\u2013466 (2008)","journal-title":"ITA"},{"issue":"3","key":"14_CR3","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1016\/j.tcs.2005.11.034","volume":"354","author":"J Berstel","year":"2006","unstructured":"Berstel, J., Boasson, L., Carton, O., Petazzoni, B., Pin, J.E.: Operations preserving regular languages. Theor. Comput. Sci. 354(3), 405\u2013420 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"14_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/978-3-319-23660-5_10","volume-title":"Combinatorics on Words","author":"J Endrullis","year":"2015","unstructured":"Endrullis, J., Grabmayer, C., Hendriks, D., Zantema, H.: The degree of squares is an atom. In: Manea, F., Nowotka, D. (eds.) WORDS 2015. LNCS, vol. 9304, pp. 109\u2013121. Springer, Heidelberg (2015)"},{"unstructured":"Endrullis, J., Hansen, H.H., Hendriks, D., Polonsky, A., Silva, A.: A coinductive framework for infinitary rewriting and equational reasoning. In: Proceedings of Conference on Rewriting Techniques and Applications (RTA 2015). Schloss Dagstuhl (2015)","key":"14_CR5"},{"issue":"28","key":"14_CR6","doi-asserted-by":"crossref","first-page":"3203","DOI":"10.1016\/j.tcs.2011.03.024","volume":"412","author":"J Endrullis","year":"2011","unstructured":"Endrullis, J., Hendriks, D.: Lazy productivity via termination. Theor. Comput. Sci. 412(28), 3203\u20133225 (2011)","journal-title":"Theor. Comput. Sci."},{"issue":"A6","key":"14_CR7","first-page":"1","volume":"11B","author":"J Endrullis","year":"2011","unstructured":"Endrullis, J., Hendriks, D., Klop, J.W.: Degrees of streams. J. Integers 11B(A6), 1\u201340 (2011). Proceedings of the Leiden Numeration Conference 2010","journal-title":"J. Integers"},{"doi-asserted-by":"crossref","unstructured":"Endrullis, J., Karhum\u00e4ki, J., Klop, J., Saarela, A.: Degrees of infinite words, polynomials and atoms (extended version). CoRR (2016)","key":"14_CR8","DOI":"10.1007\/978-3-662-53132-7_14"},{"key":"14_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-3-319-23660-5_1","volume-title":"Combinatorics on Words","author":"J Endrullis","year":"2015","unstructured":"Endrullis, J., Klop, J.W., Saarela, A., Whiteland, M.: Degrees of transducibility. In: Manea, F., Nowotka, D. (eds.) WORDS 2015. LNCS, vol. 9304, pp. 1\u201313. Springer, Heidelberg (2015)"},{"key":"14_CR10","volume-title":"Inequalities","author":"GH Hardy","year":"1988","unstructured":"Hardy, G.H., Littlewood, J.E., P\u00f3lya, G.: Inequalities. Cambridge University Press, Cambridge (1988). Reprint of the 1952 edition"},{"key":"14_CR11","series-title":"Trends in Logic","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-1-4020-2776-5_1","volume-title":"Classical and New Paradigms of Computation and their Complexity Hierarchies","author":"B L\u00f6we","year":"2004","unstructured":"L\u00f6we, B.: Complexity hierarchies derived from reduction functions. In: L\u00f6we, B., Piwinger, B., R\u00e4sch, T. (eds.) Classical and New Paradigms of Computation and their Complexity Hierarchies. Trends in Logic, vol. 23, pp. 1\u201314. Springer, Amsterdam (2004)"},{"key":"14_CR12","volume-title":"Classical Recursion Theory. Studies in Logic and the Foundations of Mathematics","author":"P Odifreddi","year":"1999","unstructured":"Odifreddi, P.: Classical Recursion Theory. Studies in Logic and the Foundations of Mathematics. North-Holland Publishing Co., Amsterdam (1999)"},{"issue":"2","key":"14_CR13","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1016\/S0019-9958(74)80053-7","volume":"24","author":"G Rayna","year":"1974","unstructured":"Rayna, G.: Degrees of finite-state transformability. Inf. Control 24(2), 144\u2013154 (1974)","journal-title":"Inf. Control"},{"key":"14_CR14","volume-title":"Elements of Automata Theory","author":"J Sakarovitch","year":"2003","unstructured":"Sakarovitch, J.: Elements of Automata Theory. Cambridge University Press, Cambridge (2003)"},{"key":"14_CR15","volume-title":"Degrees of Unsolvability","author":"JR Shoenfield","year":"1971","unstructured":"Shoenfield, J.R.: Degrees of Unsolvability. North-Holland, Elsevier, New York (1971)"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-53132-7_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,11]],"date-time":"2019-09-11T07:27:52Z","timestamp":1568186872000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-53132-7_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662531310","9783662531327"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-53132-7_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}