{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:46:51Z","timestamp":1725536811994},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642038150"},{"type":"electronic","value":"9783642038167"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-03816-7_45","type":"book-chapter","created":{"date-parts":[[2009,8,19]],"date-time":"2009-08-19T10:43:03Z","timestamp":1250678583000},"page":"525-536","source":"Crossref","is-referenced-by-count":0,"title":["On the Recognizability of Self-generating Sets"],"prefix":"10.1007","author":[{"given":"Tomi","family":"K\u00e4rki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anne","family":"Lacroix","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michel","family":"Rigo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"45_CR1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546563","volume-title":"Automatic Sequences: Theory, Applications, Generalizations","author":"J.-P. Allouche","year":"2003","unstructured":"Allouche, J.-P., Shallit, J.: Automatic Sequences: Theory, Applications, Generalizations. Cambridge University Press, Cambridge (2003)"},{"key":"45_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.disc.2004.12.004","volume":"292","author":"J.-P. Allouche","year":"2005","unstructured":"Allouche, J.-P., Shallit, J., Skordev, G.: Self-generating sets, integers with missing blocks, and substitutions. Discrete Math.\u00a0292, 1\u201315 (2005)","journal-title":"Discrete Math."},{"key":"45_CR3","doi-asserted-by":"crossref","first-page":"191","DOI":"10.36045\/bbms\/1103408547","volume":"1","author":"V. Bruy\u00e8re","year":"1994","unstructured":"Bruy\u00e8re, V., Hansel, G., Michaux, C., Villemaire, R.: Logic and p-recognizable sets of integers. Bull. Belg. Math. Soc.\u00a01, 191\u2013238 (1994)","journal-title":"Bull. Belg. Math. Soc."},{"key":"45_CR4","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/BF01746527","volume":"3","author":"A. Cobham","year":"1969","unstructured":"Cobham, A.: On the base-dependence of sets of numbers recognizable by finite automata. Math. Systems Theory\u00a03, 186\u2013192 (1969)","journal-title":"Math. Systems Theory"},{"key":"45_CR5","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/BF01706087","volume":"6","author":"A. Cobham","year":"1972","unstructured":"Cobham, A.: Uniform tag sequences. Math. Systems Theory\u00a06, 186\u2013192 (1972)","journal-title":"Math. Systems Theory"},{"key":"45_CR6","series-title":"Pure and Applied Mathematics","volume-title":"Automata, languages, and machines","author":"S. Eilenberg","year":"1974","unstructured":"Eilenberg, S.: Automata, languages, and machines. Pure and Applied Mathematics, vol.\u00a0A, 58. Academic Press, New York (1974)"},{"key":"45_CR7","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/BF01368783","volume":"25","author":"C. Frougny","year":"1992","unstructured":"Frougny, C.: Representations of numbers and finite automata. Math. Systems Theory\u00a025, 37\u201360 (1992)","journal-title":"Math. Systems Theory"},{"key":"45_CR8","unstructured":"Garth, D., Gouge, A.: Affinely self-generating sets and morphisms. J. Integer Seq.\u00a010, Article 07.1.5 (2007)"},{"key":"45_CR9","volume-title":"Introduction to the Theory of Numbers","author":"G.H. Hardy","year":"1985","unstructured":"Hardy, G.H., Wright, E.M.: Introduction to the Theory of Numbers. Oxford Univ. Press, Oxford (1985)"},{"key":"45_CR10","unstructured":"Kimberling, C.: A self-generating set and the golden mean. J. Integer Seq.\u00a03, Article 00.2.8 (2000)"},{"key":"45_CR11","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/S0012-365X(03)00085-2","volume":"274","author":"C. Kimberling","year":"2004","unstructured":"Kimberling, C.: Affinely recursive sets and orderings of languages. Discrete Math.\u00a0274, 147\u2013159 (2004)","journal-title":"Discrete Math."},{"key":"45_CR12","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/s002240010014","volume":"34","author":"P.B.A. Lecomte","year":"2001","unstructured":"Lecomte, P.B.A., Rigo, M.: Numeration systems on a regular language. Theory Comput. Syst.\u00a034, 27\u201344 (2001)","journal-title":"Theory Comput. Syst."},{"key":"45_CR13","volume-title":"Encyclopedia of Mathematics and its Applications","author":"M. Lothaire","year":"2002","unstructured":"Lothaire, M.: Algebraic Combinatorics on Words. In: Encyclopedia of Mathematics and its Applications, vol.\u00a090. Cambridge University Press, Cambridge (2002)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03816-7_45","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,21]],"date-time":"2020-05-21T10:57:49Z","timestamp":1590058669000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03816-7_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642038150","9783642038167"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03816-7_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}