{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T18:54:04Z","timestamp":1742928844910,"version":"3.40.3"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319155784"},{"type":"electronic","value":"9783319155791"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-15579-1_56","type":"book-chapter","created":{"date-parts":[[2015,2,23]],"date-time":"2015-02-23T08:36:13Z","timestamp":1424680573000},"page":"716-726","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Rational Selecting Relations and Selectors"],"prefix":"10.1007","author":[{"given":"Luc","family":"Boasson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Olivier","family":"Carton","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,2,24]]},"reference":[{"key":"56_CR1","first-page":"324","volume":"9","author":"VN Agafonov","year":"1968","unstructured":"Agafonov, V.N.: Normal sequences and finite automata. Soviet Mathematics Doklady 9, 324\u2013325 (1968)","journal-title":"Soviet Mathematics Doklady"},{"key":"56_CR2","doi-asserted-by":"crossref","unstructured":"Berstel, J.: Transductions and Context-Free Languages. B.G. Teubner (1979)","DOI":"10.1007\/978-3-663-09367-1"},{"key":"56_CR3","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1016\/j.tcs.2007.01.012","volume":"376","author":"O Carton","year":"2007","unstructured":"Carton, O.: The growth ratio of synchronous rational relations is unique. Theoret. Comput. Sci. 376, 52\u201359 (2007)","journal-title":"Theoret. Comput. Sci."},{"key":"56_CR4","doi-asserted-by":"crossref","unstructured":"Choffrut, C., Karhum\u00e4ki, J.: On Fatou properties of rational languages. In: Where Mathematics, Computer Science, Linguistics and Biology Meet: Essays in Honour of Gheorghe Paun. Kluwer Academic Publishers (2001)","DOI":"10.1007\/978-94-015-9634-3_20"},{"key":"56_CR5","volume-title":"Automata, Languages and Machines","author":"S Eilenberg","year":"1972","unstructured":"Eilenberg, S.: Automata, Languages and Machines, vol. A. Academic Press, New York (1972)"},{"key":"56_CR6","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1147\/rd.91.0047","volume":"9","author":"CC Elgot","year":"1965","unstructured":"Elgot, C.C., Mezei, J.E.: On relations defined by generalized finite automata. IBM Journal Res. and Dev. 9, 47\u201368 (1965)","journal-title":"IBM Journal Res. and Dev."},{"key":"56_CR7","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1112\/plms\/s3-2.1.326","volume":"2","author":"G Higman","year":"1952","unstructured":"Higman, G.: Ordering by divisibility in abstract algebra. Proc. London Math. Soc. 2, 326\u2013336 (1952)","journal-title":"Proc. London Math. Soc."},{"key":"56_CR8","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1051\/ita\/1981150201411","volume":"5","author":"J Leguy","year":"1981","unstructured":"Leguy, J.: Transductions rationnelles d\u00e9croissantes. R.A.I.R.O.-Informatique Th\u00e9orique et Applications 5, 141\u2013148 (1981)","journal-title":"R.A.I.R.O.-Informatique Th\u00e9orique et Applications"},{"key":"56_CR9","volume-title":"Combinatorics on Words, Encyclopedia of Mathematics and its Applications","author":"M Lothaire","year":"1983","unstructured":"Lothaire, M.: Combinatorics on Words, Encyclopedia of Mathematics and its Applications, vol. 17. Addison-Wesley, Reading (1983)"},{"key":"56_CR10","unstructured":"Perrin, D., Pin, J.\u00c9.: Infinite Words. Elsevier (2004)"},{"key":"56_CR11","doi-asserted-by":"crossref","unstructured":"Sakarovitch, J.: Elements of Automata Theory. Cambridge University Press (2009)","DOI":"10.1017\/CBO9781139195218"}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-15579-1_56","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,10]],"date-time":"2023-02-10T06:12:02Z","timestamp":1676009522000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-15579-1_56"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319155784","9783319155791"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-15579-1_56","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"24 February 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}