{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T00:11:04Z","timestamp":1742947864900,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540642756"},{"type":"electronic","value":"9783540697152"}],"license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"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":[[1998]]},"DOI":"10.1007\/bfb0054309","type":"book-chapter","created":{"date-parts":[[2006,6,7]],"date-time":"2006-06-07T05:37:37Z","timestamp":1149658657000},"page":"42-52","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Super-state automata and rational trees"],"prefix":"10.1007","author":[{"given":"Fr\u00e9d\u00e9rique","family":"Bassino","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marie -Pierre","family":"B\u00e9al","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dominique","family":"Perrin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,5,25]]},"reference":[{"key":"5_CR1","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1109\/TIT.1983.1056597","volume":"IT-29","author":"R. L. Adler","year":"1983","unstructured":"R. L. Adler, D. Coppersmith, and M. Hassner. Algorithms for sliding block codes. I.E.E.E. Trans. Inform. Theory, IT-29:5\u201322, 1983.","journal-title":"I.E.E.E. Trans. Inform. Theory"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"F. Bassino, M.-P. B\u00e9al, and D. Perrin. Enumerative sequences of leaves and nodes in rational trees. Theoret. Comput. Sci., 1997. (to appear).","DOI":"10.1007\/3-540-63165-8_166"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"F. Bassino, M.-P. B\u00e9al, and D. Perrin. Enumerative sequences of leaves in rational trees. In ICALP'97, LNCS 1256, pages 76\u201386. Springer, 1997.","DOI":"10.1007\/3-540-63165-8_166"},{"key":"5_CR4","unstructured":"M.-P. B\u00e9al. Codage Symbolique. Masson, 1993."},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"M.-P. B\u00e9al and D. Perrin. Symbolic dynamics and finite automata. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, volume 2, chapter 10. Springer-Verlag, 1997.","DOI":"10.1007\/978-3-662-07675-0_10"},{"key":"5_CR6","unstructured":"J. Berstel and C. Reutenauer. Rational Series and their Languages Springer-Verlag, 1988."},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"D. Lind and B. Marcus. An Introduction to Symbolic Dynamics and Coding Cambridge, 1995.","DOI":"10.1017\/CBO9780511626302"},{"key":"5_CR8","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/BF01295238","volume":"88","author":"B. Marcus","year":"1979","unstructured":"B. Marcus. Factors and extensions of full shifts. Monats.Math, 88:239\u2013247, 1979.","journal-title":"Monats.Math"},{"key":"5_CR9","first-page":"713","volume":"309","author":"D. Perrin","year":"1989","unstructured":"D. Perrin. Arbres et s\u00e9ries rationnelles. C.R.A.S. Paris, S\u00e9rie I, 309:713\u2013716, 1989.","journal-title":"C.R.A.S. Paris, S\u00e9rie I"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"D. Perrin. A conjecture on rational sequences. In R. Capocelli, editor, Sequences, pages 267\u2013274. Springer-Verlag, 1990.","DOI":"10.1007\/978-1-4612-3352-7_21"},{"key":"5_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-6264-0","volume-title":"Automata-theoretic Aspect of Formal Power Series","author":"A. Salomaa","year":"1978","unstructured":"A. Salomaa and M. Soittola. Automata-theoretic Aspect of Formal Power Series. Springer-Verlag, Berlin, 1978."}],"container-title":["Lecture Notes in Computer Science","LATIN'98: Theoretical Informatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0054309","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,10]],"date-time":"2023-02-10T18:37:22Z","timestamp":1676054242000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/BFb0054309"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540642756","9783540697152"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/bfb0054309","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]},"assertion":[{"value":"25 May 2006","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}