{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T18:10:58Z","timestamp":1725905458396},"publisher-location":"Cham","reference-count":9,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319628080"},{"type":"electronic","value":"9783319628097"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-62809-7_28","type":"book-chapter","created":{"date-parts":[[2017,7,20]],"date-time":"2017-07-20T04:37:57Z","timestamp":1500525477000},"page":"365-377","source":"Crossref","is-referenced-by-count":1,"title":["Classifying Non-periodic Sequences by Permutation Transducers"],"prefix":"10.1007","author":[{"given":"Hans","family":"Zantema","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wieb","family":"Bosma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,7,21]]},"reference":[{"key":"28_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, Cambridge (2003)"},{"key":"28_CR2","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1016\/j.indag.2016.11.004","volume":"38","author":"W Bosma","year":"2017","unstructured":"Bosma, W., Zantema, H.: Ordering sequences by permutation transducers. Indagationes Math. 38, 38\u201354 (2017)","journal-title":"Indagationes Math."},{"key":"28_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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, Cham (2015). doi:\n10.1007\/978-3-319-23660-5_10"},{"issue":"A6","key":"28_CR4","first-page":"1","volume":"11B","author":"J Endrullis","year":"2011","unstructured":"Endrullis, J., Hendriks, D., Klop, J.W.: Degrees of streams. Integers Electron. J. Comb. Number Theor. 11B(A6), 1\u201340 (2011). Proceedings of Leiden Numeration Conference (2010)","journal-title":"Integers Electron. J. Comb. Number Theor."},{"key":"28_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/978-3-662-53132-7_14","volume-title":"Developments in Language Theory","author":"J Endrullis","year":"2016","unstructured":"Endrullis, J., Karhum\u00e4ki, J., Klop, J.W., Saarela, A.: Degrees of infinite words, polynomials and atoms. In: Brlek, S., Reutenauer, C. (eds.) DLT 2016. LNCS, vol. 9840, pp. 164\u2013176. Springer, Heidelberg (2016). doi:\n10.1007\/978-3-662-53132-7_14"},{"key":"28_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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, Cham (2015). doi:\n10.1007\/978-3-319-23660-5_1"},{"key":"28_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/BFb0023844","volume-title":"LATIN \u201992","author":"J-E Pin","year":"1992","unstructured":"Pin, J.-E.: On reversible automata. In: Simon, I. (ed.) LATIN 1992. LNCS, vol. 583, pp. 401\u2013416. Springer, Heidelberg (1992). doi:\n10.1007\/BFb0023844"},{"key":"28_CR8","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139195218","volume-title":"Elements of automata theory","author":"J Sakarovitch","year":"2009","unstructured":"Sakarovitch, J.: Elements of automata theory. Cambridge University Press, Cambridge (2009)"},{"key":"28_CR9","unstructured":"Zantema, H., Bosma, W.: Extended version of this paper (2017). \nhttp:\/\/www.win.tue.nl\/~hzantema\/permtr.pdf"}],"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-319-62809-7_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,7,20]],"date-time":"2017-07-20T04:43:47Z","timestamp":1500525827000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-62809-7_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319628080","9783319628097"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-62809-7_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}