{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T14:33:47Z","timestamp":1726410827141},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662495285"},{"type":"electronic","value":"9783662495292"}],"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-49529-2_45","type":"book-chapter","created":{"date-parts":[[2016,3,21]],"date-time":"2016-03-21T04:09:41Z","timestamp":1458533381000},"page":"605-618","source":"Crossref","is-referenced-by-count":0,"title":["Trees and Languages with Periodic Signature"],"prefix":"10.1007","author":[{"given":"Victor","family":"Marsault","sequence":"first","affiliation":[]},{"given":"Jacques","family":"Sakarovitch","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,3,22]]},"reference":[{"key":"45_CR1","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/s11856-008-1056-4","volume":"168","author":"S Akiyama","year":"2008","unstructured":"Akiyama, S., Frougny, C., Sakarovitch, J.: Powers of rationals modulo 1 and rational base number systems. Isr. J. Math. 168, 53\u201391 (2008)","journal-title":"Isr. J. Math."},{"key":"45_CR2","doi-asserted-by":"crossref","unstructured":"Berstel, J., Lauve, A., Reutenauer, C., Saliola, F.: Combinatorics on Words: Christoffel Words and Repetition in Words, vol. 27 of CRM Monograph Series. American Math. Soc., Providence, Rhode Island, USA (2008)","DOI":"10.1090\/crmm\/027"},{"key":"45_CR3","volume-title":"Graph Theory","author":"R Diestel","year":"1997","unstructured":"Diestel, R.: Graph Theory. Springer, New York (1997)"},{"issue":"1","key":"45_CR4","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1051\/ita\/2011114","volume":"46","author":"C Frougny","year":"2012","unstructured":"Frougny, C., Klouda, K.: Rational base number systems for p-adic numbers. RAIRO Theor. Inf. Appl. 46(1), 87\u2013106 (2012)","journal-title":"RAIRO Theor. Inf. Appl."},{"key":"45_CR5","volume-title":"Combinatorics, Automata and Number Theory","author":"C Frougny","year":"2010","unstructured":"Frougny, C., Sakarovitch, J.: Number representation and finite automata. In: Berth\u00e9, V., Rigo, M. (eds.) Combinatorics, Automata and Number Theory. Cambridge University Press, Cambridge (2010)"},{"issue":"2","key":"45_CR6","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/S0022-0000(75)80042-0","volume":"10","author":"SA Greibach","year":"1975","unstructured":"Greibach, S.A.: One counter languages and the IRS condition. J. Comput. Syst. Sci. 10(2), 237\u2013247 (1975)","journal-title":"J. Comput. Syst. Sci."},{"key":"45_CR7","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/s002240010014","volume":"34","author":"P Lecomte","year":"2001","unstructured":"Lecomte, P., Rigo, M.: Numeration systems on a regular language. Theor. Comput. Syst. 34, 27\u201344 (2001)","journal-title":"Theor. Comput. Syst."},{"key":"45_CR8","volume-title":"Combinatorics, Automata and Number Theory","author":"P Lecomte","year":"2010","unstructured":"Lecomte, P., Rigo, M.: Abstract numeration systems. In: Berth\u00e9, V., Rigo, M. (eds.) Combinatorics, Automata and Number Theory. Cambridge University Press, Cambridge (2010)"},{"key":"45_CR9","unstructured":"Marsault, V., Sakarovitch, J.: Rhythmic generation of infinite trees, languages (full version). In preparation. Preprint available at \n                    arXiv:1403.5190"},{"key":"45_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/978-3-642-40663-8_10","volume-title":"Algebraic Informatics","author":"V Marsault","year":"2013","unstructured":"Marsault, V., Sakarovitch, J.: On sets of numbers rationally represented in a rational base number system. In: Muntean, T., Poulakis, D., Rolland, R. (eds.) CAI 2013. LNCS, vol. 8080, pp. 89\u2013100. Springer, Heidelberg (2013)"},{"key":"45_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1007\/978-3-319-09698-8_22","volume-title":"Developments in Language Theory","author":"V Marsault","year":"2014","unstructured":"Marsault, V., Sakarovitch, J.: Breadth-first serialisation of trees and rational languages. In: Shur, A.M., Volkov, M.V. (eds.) DLT 2014. LNCS, vol. 8633, pp. 252\u2013259. Springer, Heidelberg (2014)"}],"container-title":["Lecture Notes in Computer Science","LATIN 2016: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-49529-2_45","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T16:18:42Z","timestamp":1559405922000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-49529-2_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662495285","9783662495292"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-49529-2_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}