{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T12:00:09Z","timestamp":1725796809145},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319088457"},{"type":"electronic","value":"9783319088464"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"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":[[2014]]},"DOI":"10.1007\/978-3-319-08846-4_19","type":"book-chapter","created":{"date-parts":[[2014,7,4]],"date-time":"2014-07-04T07:56:43Z","timestamp":1404460603000},"page":"252-263","source":"Crossref","is-referenced-by-count":2,"title":["Analytic Functions Computable by Finite State Transducers"],"prefix":"10.1007","author":[{"given":"Petr","family":"K\u016frka","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tom\u00e1\u0161","family":"V\u00e1vra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"Avizienis, A.: Signed-digit number representations for fast parallel arithmetic. IRE Transactions on Electronic Computers EC-10 (1961)","DOI":"10.1109\/TEC.1961.5219227"},{"key":"19_CR2","volume-title":"The geometry of discrete groups","author":"A.F. Beardon","year":"1995","unstructured":"Beardon, A.F.: The geometry of discrete groups. Springer, Berlin (1995)"},{"key":"19_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/978-3-642-32589-2_30","volume-title":"Mathematical Foundations of Computer Science 2012","author":"M. Delacourt","year":"2012","unstructured":"Delacourt, M., K\u016frka, P.: Finite state transducers for modular m\u00f6bius number systems. In: Rovan, B., Sassone, V., Widmayer, P. (eds.) MFCS 2012. LNCS, vol.\u00a07464, pp. 323\u2013334. Springer, Heidelberg (2012)"},{"key":"19_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-48340-3_1","volume-title":"Mathematical Foundations of Computer Science 1999","author":"C. Frougny","year":"1999","unstructured":"Frougny, C.: On-line addition in real base. In: Kuty\u0142owski, M., Wierzbicki, T., Pacholski, L. (eds.) MFCS 1999. LNCS, vol.\u00a01672, pp. 1\u201311. Springer, Heidelberg (1999)"},{"key":"19_CR5","unstructured":"Gosper, R.W.: Continued fractions arithmetic (1977) (unpublished manuscript), \n                    \n                      http:\/\/www.tweedledum.com\/rwg\/cfup.htm"},{"issue":"4","key":"19_CR6","doi-asserted-by":"publisher","first-page":"789","DOI":"10.1137\/S0097539791224893","volume":"23","author":"K. Culik II","year":"1994","unstructured":"Culik II, K., Karhumaki, J.: Finite automata computing real functions. SIAM Journal on Computing\u00a023(4), 789\u2013914 (1994)","journal-title":"SIAM Journal on Computing"},{"key":"19_CR7","doi-asserted-by":"publisher","first-page":"1791","DOI":"10.1016\/j.laa.2011.10.031","volume":"436","author":"J. Kari","year":"2012","unstructured":"Kari, J., Kazda, A., Steinby, P.: On continuous weighted finite automata. Linear Algebra and its Applications\u00a0436, 1791\u20131824 (2012)","journal-title":"Linear Algebra and its Applications"},{"issue":"1","key":"19_CR8","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.tcs.2003.11.015","volume":"315","author":"M. Kone\u010dn\u00fd","year":"2004","unstructured":"Kone\u010dn\u00fd, M.: Real functions incrementally computable by finite automata. Theoretical Computer Science\u00a0315(1), 109\u2013133 (2004)","journal-title":"Theoretical Computer Science"},{"key":"19_CR9","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511778568","volume-title":"Finite precision number systems and arithmetic","author":"P. Kornerup","year":"2010","unstructured":"Kornerup, P., Matula, D.W.: Finite precision number systems and arithmetic. Cambridge University Press, Cambridge (2010)"},{"issue":"8","key":"19_CR10","doi-asserted-by":"publisher","first-page":"1106","DOI":"10.1109\/12.57048","volume":"39","author":"P. Kornerup","year":"1990","unstructured":"Kornerup, P., Matula, D.W.: An algorithm for redundant binary bit-pipelined rational arithmetic. IEEE Transactions on Computers\u00a039(8), 1106\u20131115 (1990)","journal-title":"IEEE Transactions on Computers"},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"K\u016frka, P.: Topological and symbolic dynamics, volume\u00a011 of Cours sp\u00e9cialis\u00e9s. Soci\u00e9t\u00e9 Math\u00e9matique de France, Paris (2003)","DOI":"10.1515\/dmvm-2003-0028"},{"key":"19_CR12","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1088\/0951-7715\/22\/2\/011","volume":"22","author":"P. K\u016frka","year":"2009","unstructured":"K\u016frka, P.: M\u00f6bius number systems with sofic subshifts. Nonlinearity\u00a022, 437\u2013456 (2009)","journal-title":"Nonlinearity"},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"K\u016frka, P., Delacourt, M.: The unary arithmetical algorithm in bimodular number systems. In: 2013 IEEE 21st Symposium on Computer Arithmetic ARITH-21, pp. 127\u2013134. IEEE Computer Society (2013)","DOI":"10.1109\/ARITH.2013.10"},{"key":"19_CR14","unstructured":"Potts, P.J.: Exact real arithmetic using M\u00f6bius transformations. PhD thesis, University of London, Imperial College, London (1998)"},{"key":"19_CR15","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF01355980","volume":"206","author":"G.N. Raney","year":"1973","unstructured":"Raney, G.N.: On contiuned fractions and finite automata. Mathematische Annalen\u00a0206, 265\u2013283 (1973)","journal-title":"Mathematische Annalen"},{"issue":"8","key":"19_CR16","doi-asserted-by":"publisher","first-page":"1087","DOI":"10.1109\/12.57047","volume":"39","author":"J.E. Vuillemin","year":"1990","unstructured":"Vuillemin, J.E.: Exact real computer arithmetic with continued fractions. IEEE Transactions on Computers\u00a039(8), 1087\u20131105 (1990)","journal-title":"IEEE Transactions on Computers"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-08846-4_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T03:03:14Z","timestamp":1558926194000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-08846-4_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319088457","9783319088464"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-08846-4_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}