{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,30]],"date-time":"2025-05-30T04:11:12Z","timestamp":1748578272201,"version":"3.41.0"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319218182"},{"type":"electronic","value":"9783319218199"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-21819-9_2","type":"book-chapter","created":{"date-parts":[[2015,8,3]],"date-time":"2015-08-03T11:16:31Z","timestamp":1438600591000},"page":"35-52","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Ultrametric Algorithms and Automata"],"prefix":"10.1007","author":[{"given":"R\u016bsi\u0146\u0161","family":"Freivalds","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,8,4]]},"reference":[{"issue":"2","key":"2_CR1","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1016\/j.jcss.2005.06.006","volume":"72","author":"A Ambainis","year":"2006","unstructured":"Ambainis, A.: Polynomial degree vs. quantum query complexity. J. Comput. Syst. Sci. 72(2), 220\u2013238 (2006)","journal-title":"J. Comput. Syst. Sci."},{"key":"2_CR2","series-title":"Applied Condition Monitoring","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/978-3-319-12877-1_5","volume-title":"Stochastic Modeling of Thermal Fatigue Crack Growth","author":"V Radu","year":"2015","unstructured":"Radu, V.: Application. In: Radu, V. (ed.) Stochastic Modeling of Thermal Fatigue Crack Growth. ACM, vol. 1, pp. 63\u201370. Springer, Heidelberg (2015)"},{"key":"2_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/BFb0019368","volume-title":"Baltic Computer Science","author":"R Freivalds","year":"1991","unstructured":"Freivalds, R.: Complexity of probabilistic versus deterministic automata. In: B\u0101rzdin\u0161, J., Bj\u00f8rner, D. (eds.) Baltic Computer Science. LNCS, vol. 502, pp. 565\u2013613. Springer, Heidelberg (1991)"},{"issue":"3","key":"2_CR4","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1142\/S0129054108005826","volume":"19","author":"R Freivalds","year":"2008","unstructured":"Freivalds, R.: Non-constructive methods for finite probabilistic automata. Int. J. Found. Comput. Sci. 19(3), 565\u2013580 (2008)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Freivalds, R.: Ultrametric automata and Turing machines. In: Voronkov, A. (ed.) Turing-100. EPiC Series, vol. 10, pp. 98\u2013112. EasyChair (2012)","DOI":"10.29007\/tdf5"},{"key":"2_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-38771-5_1","volume-title":"Developments in Language Theory","author":"R Freivalds","year":"2013","unstructured":"Freivalds, R.: Ultrametric finite automata and turing machines. In: B\u00e9al, M.-P., Carton, O. (eds.) DLT 2013. LNCS, vol. 7907, pp. 1\u201311. Springer, Heidelberg (2013)"},{"key":"2_CR7","series-title":"Universitext","volume-title":"p-adic Numbers: An Introduction","author":"FQ Gouvea","year":"1983","unstructured":"Gouvea, F.Q.: p-adic Numbers: An Introduction. Universitext, 2nd edn. Springer, Heidelberg (1983)","edition":"2"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Grover, L.K.: A fast quantum mechanical algorithm for database search. In: Proceedings of the 28th ACM Symposium on Theory of Computing, pp. 212\u2013219 (1996)","DOI":"10.1145\/237814.237866"},{"key":"2_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04461-2","volume-title":"Quantum Computing","author":"M Hirvensalo","year":"2001","unstructured":"Hirvensalo, M.: Quantum Computing. Springer, Heidelberg (2001)"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"Khrennikov, A.Yu.: Non-Archimedean Analysis: Quantum Paradoxes, Dynamical Systems and Biological Models. Kluwer Academic Publishers, Dordrecht (1997)","DOI":"10.1007\/978-94-009-1483-4"},{"key":"2_CR11","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1112-9","volume-title":"p-adic Numbers, p-adic Analysis, and Zeta-Functions","author":"N Koblitz","year":"1984","unstructured":"Koblitz, N.: p-adic Numbers, p-adic Analysis, and Zeta-Functions. Graduate Texts in Mathematics, vol. 58, 2nd edn. Springer, Heidelberg (1984)","edition":"2"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"Kozyrev, S.V.: Ultrametric analysis and interbasin kinetics. In: Proceedings of the 2nd International Conference on p-Adic Mathematical Physics, American Institute Conference Proceedings, vol. 826, pp. 121\u2013128 (2006)","DOI":"10.1063\/1.2193116"},{"key":"2_CR13","first-page":"102","volume":"10","author":"AG Lunts","year":"1965","unstructured":"Lunts, A.G.: A method of analysis of finite automata. Sov. Phys. Dokl. 10, 102\u2013105 (1965)","journal-title":"Sov. Phys. Dokl."},{"key":"2_CR14","unstructured":"Madore, D.A.: A first introduction to $$p$$-adic numbers. http:\/\/www.madore.org\/david\/math\/padics.pdf"},{"issue":"4","key":"2_CR15","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1007\/BF01192527","volume":"15","author":"N Nisan","year":"1995","unstructured":"Nisan, N., Wigderson, A.: On rank vs. communication complexity. Combinatorica 15(4), 557\u2013565 (1995)","journal-title":"Combinatorica"},{"issue":"1","key":"2_CR16","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/BF02422947","volume":"41","author":"A Ostrowski","year":"1916","unstructured":"Ostrowski, A.: \u00dcber einige L\u00f6sungen der funktionalgleichung $$\\varphi (x)\\varphi (y) = \\varphi (xy)$$. Acta Math. 41(1), 271\u2013284 (1916)","journal-title":"Acta Math."},{"issue":"2","key":"2_CR17","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1090\/S0002-9939-1969-0242596-1","volume":"21","author":"P Turakainen","year":"1969","unstructured":"Turakainen, P.: Generalized automata and stochastic languages. Proc. Am. Math. Soc. 21(2), 303\u2013309 (1969)","journal-title":"Proc. Am. Math. Soc."},{"key":"2_CR18","volume-title":"p-Adic Analysis and Mathematical Physics","author":"VS Vladimirov","year":"1995","unstructured":"Vladimirov, V.S., Volovich, I.V., Zelenov, E.I.: p-Adic Analysis and Mathematical Physics. World Scientific, Singapore (1995)"}],"container-title":["Lecture Notes in Computer Science","Unconventional Computation and Natural Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-21819-9_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,29]],"date-time":"2025-05-29T21:15:00Z","timestamp":1748553300000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-21819-9_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319218182","9783319218199"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21819-9_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"4 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}