{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,13]],"date-time":"2025-10-13T19:08:42Z","timestamp":1760382522129},"reference-count":23,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1996,8,1]],"date-time":"1996-08-01T00:00:00Z","timestamp":838857600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6194,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1996,8]]},"DOI":"10.1016\/0304-3975(95)00234-0","type":"journal-article","created":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T01:37:28Z","timestamp":1051753048000},"page":"193-210","source":"Crossref","is-referenced-by-count":11,"title":["On the vector space of the automatic reals"],"prefix":"10.1016","volume":"163","author":[{"given":"Siegfried","family":"Lehr","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeffrey","family":"Shallit","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John","family":"Tromp","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(95)00234-0_BIB1","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0304-3975(92)90001-V","article-title":"The ring of k-regular sequences","volume":"98","author":"Allouche","year":"1992","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(95)00234-0_BIB2","first-page":"323","article-title":"The diophantine equation \u2211i=1n12xi = 1 and its connection with graph theory and information theory","volume":"18","author":"Bende","year":"1967","journal-title":"Mat. Lapok"},{"key":"10.1016\/0304-3975(95)00234-0_BIB3","series-title":"Sequences II: Methods in Communication, Security, and Computer Science","first-page":"3","article-title":"On the enumeration of dyadic distributions","author":"Blake","year":"1993"},{"key":"10.1016\/0304-3975(95)00234-0_BIB4","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1016\/0097-3165(75)90011-4","article-title":"The asymptotic number of solutions of a diophantine equation from coding theory","volume":"18","author":"Boyd","year":"1975","journal-title":"J. Combin. Theory. Ser. A"},{"key":"10.1016\/0304-3975(95)00234-0_BIB5","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0040-9383(83)90046-0","article-title":"G.B. Segal's Burnside ring conjecture for (Z2)k","volume":"22","author":"Carlsson","year":"1983","journal-title":"Topology"},{"key":"10.1016\/0304-3975(95)00234-0_BIB6","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1007\/BF01706087","article-title":"Uniform tag sequences","volume":"6","author":"Cobham","year":"1972","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0304-3975(95)00234-0_BIB7","volume":"Vol. A","author":"Eilenberg","year":"1974"},{"key":"10.1016\/0304-3975(95)00234-0_BIB8","doi-asserted-by":"crossref","first-page":"476","DOI":"10.1016\/S0019-9958(72)90149-0","article-title":"Generation and enumeration of all solutions of the characteristic sum condition","volume":"21","author":"Even","year":"1972","journal-title":"Inform. Control"},{"key":"10.1016\/0304-3975(95)00234-0_BIB9","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/0012-365X(87)90137-3","article-title":"Level number sequences for trees","volume":"65","author":"Flajolet","year":"1987","journal-title":"Discrete Math."},{"key":"10.1016\/0304-3975(95)00234-0_BIB10","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/BF01368783","article-title":"Representations of numbers and finite automata","volume":"25","author":"Frougny","year":"1992","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0304-3975(95)00234-0_BIB11","doi-asserted-by":"crossref","first-page":"304","DOI":"10.1109\/TIT.1971.1054638","article-title":"Codes based on inaccurate source probabilities","volume":"IT-17","author":"Gilbert","year":"1971","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0304-3975(95)00234-0_BIB12","series-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/0304-3975(95)00234-0_BIB13","doi-asserted-by":"crossref","first-page":"476","DOI":"10.1090\/S0002-9947-1916-1501054-4","article-title":"On transcendental numbers","volume":"17","author":"Kempner","year":"1916","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/0304-3975(95)00234-0_BIB14","doi-asserted-by":"crossref","first-page":"947","DOI":"10.2307\/2324154","article-title":"An \u201cocean of zeros\u201d proof that a certain non-Liouville number is transcendental","volume":"98","author":"Knight","year":"1991","journal-title":"Amer. Math. Monthly"},{"key":"10.1016\/0304-3975(95)00234-0_BIB15","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1016\/0304-3975(93)90202-5","article-title":"Sums and rational multiples of q-automatic sequences are q-automatic","volume":"108","author":"Lehr","year":"1993","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(95)00234-0_BIB16","first-page":"223","article-title":"A problem in partitions: enumeration of elements of a given degree in the free commutative entropic cyclic groupoids","volume":"11","author":"Minc","year":"1959"},{"key":"10.1016\/0304-3975(95)00234-0_BIB17","series-title":"An Introduction to Combinatorial Analysis","author":"Riordan","year":"1978"},{"issue":"46","key":"10.1016\/0304-3975(95)00234-0_BIB18","first-page":"182","article-title":"The 3x + 1 problem and finite automata","author":"Shallit","year":"1992","journal-title":"Bull. European Assoc. Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(95)00234-0_BIB19","author":"Sloane","year":"1973"},{"key":"10.1016\/0304-3975(95)00234-0_BIB20","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1016\/S0195-6698(13)80019-4","article-title":"Level number sequences of trees and the lambda algebra","volume":"12","author":"Tangora","year":"1991","journal-title":"European J. Combinatorics"},{"key":"10.1016\/0304-3975(95)00234-0_BIB21","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/0012-365X(94)00067-1","article-title":"Generating trees and the Catalan and Schr\u00f6der numbers","volume":"146","author":"West","year":"1995","journal-title":"Discrete Math."},{"key":"10.1016\/0304-3975(95)00234-0_BIB22","article-title":"Permutations with forbidden subsequences; and, stack-sortable permutations","author":"West","year":"1990"},{"key":"10.1016\/0304-3975(95)00234-0_BIB23","series-title":"Proc. 6th Conf. on Formal Power Series and Algebraic Combinatorics","first-page":"441","article-title":"Generating trees and forbidden subsequences","author":"West","year":"1994"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397595002340?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397595002340?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T12:54:06Z","timestamp":1555419246000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397595002340"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,8]]},"references-count":23,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1996,8]]}},"alternative-id":["0304397595002340"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(95)00234-0","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1996,8]]}}}