{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:10:58Z","timestamp":1725491458087},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540732075"},{"type":"electronic","value":"9783540732082"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-73208-2_5","type":"book-chapter","created":{"date-parts":[[2007,9,12]],"date-time":"2007-09-12T07:58:11Z","timestamp":1189583891000},"page":"29-30","source":"Crossref","is-referenced-by-count":0,"title":["Finite Automata and the Writing of Numbers"],"prefix":"10.1007","author":[{"given":"Jacques","family":"Sakarovitch","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/BF01746527","volume":"3","author":"A. Cobham","year":"1969","unstructured":"Cobham, A.: On the base-dependance of the sets of numbers recognizable by finite automata. Math. Systems Theory\u00a03, 186\u2013192 (1969)","journal-title":"Math. Systems Theory"},{"key":"5_CR2","volume-title":"Automata, Languages and Machines","author":"S. Eilenberg","year":"1974","unstructured":"Eilenberg, S.: Automata, Languages and Machines, vol.\u00a0A. Academic Press, London (1974)"},{"key":"5_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, Ch., Villemaire, R.: Logic and p-recognizable sets of integers. Bull. Belg. Soc. Math.\u00a01, 191\u2013238 (1994)","journal-title":"Bull. Belg. Soc. Math."},{"key":"5_CR4","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1051\/ita\/1986200403951","volume":"20","author":"J. Honkala","year":"1986","unstructured":"Honkala, J.: A decision method for the recognizability of sets defined by number systems. RAIRO Informatique Th\u00e9or.\u00a020, 395\u2013403 (1986)","journal-title":"RAIRO Informatique Th\u00e9or."},{"key":"5_CR5","doi-asserted-by":"publisher","first-page":"1433","DOI":"10.1016\/S0304-3975(02)00047-6","volume":"290","author":"A. Muchnik","year":"2003","unstructured":"Muchnik, A.: The definable criterion for definability in Presburger arithmetic and its applications. Theoret. Computer Sci.\u00a0290, 1433\u20131444 (2003) Late publication in a journal of a preprint (in russian) issued in 1991","journal-title":"Theoret. Computer Sci."},{"key":"5_CR6","first-page":"147","volume-title":"LICS 2005","author":"J. Leroux","year":"2005","unstructured":"Leroux, J.: A polynomial time Presburger criterion and synthesis for number decision diagrams. In: LICS 2005. Logic in Computer Science 2005, pp. 147\u2013156. IEEE Computer Society Press, Los Alamitos (2005) (New version at arXiv:cs\/0612037v1)"},{"key":"5_CR7","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1109\/TEC.1961.5219227","volume":"10","author":"A. Avizienis","year":"1961","unstructured":"Avizienis, A.: Signed-digit number representations for fast parallel arithmetic. IRE Transactions on electronic computers\u00a010, 389\u2013400 (1961)","journal-title":"IRE Transactions on electronic computers"},{"key":"5_CR8","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781107326019","volume-title":"Algebraic Combinatorics on Words","author":"M. Lothaire","year":"2002","unstructured":"Lothaire, M.: Algebraic Combinatorics on Words. Cambridge University Press, Cambridge (2002)"},{"key":"5_CR9","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/BF01368783","volume":"25","author":"C.. Frougny","year":"1992","unstructured":"Frougny, Ch.: Representation of numbers and finite automata. Math. Systems Theory\u00a025, 37\u201360 (1992)","journal-title":"Math. Systems Theory"},{"key":"5_CR10","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/BF01578846","volume":"27","author":"D. Berend","year":"1994","unstructured":"Berend, D., Frougny, Ch.: Computability by finite automata and Pisot bases. Math. Systems Theory\u00a027, 275\u2013282 (1994)","journal-title":"Math. Systems Theory"},{"key":"5_CR11","unstructured":"Akiyama, S., Frougny, Ch., Sakarovitch, J.: Powers of rationals modulo 1 and rational base number systems. Isra\u00ebl J. Math (to appear)"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73208-2_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,26]],"date-time":"2020-04-26T13:13:19Z","timestamp":1587906799000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73208-2_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540732075","9783540732082"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73208-2_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}