{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,16]],"date-time":"2025-05-16T22:40:03Z","timestamp":1747435203626,"version":"3.40.5"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662460771"},{"type":"electronic","value":"9783662460788"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-46078-8_26","type":"book-chapter","created":{"date-parts":[[2015,1,14]],"date-time":"2015-01-14T14:54:29Z","timestamp":1421247269000},"page":"314-326","source":"Crossref","is-referenced-by-count":0,"title":["On the Hierarchy Classes of Finite Ultrametric Automata"],"prefix":"10.1007","author":[{"given":"Rihards","family":"Kri\u0161lauks","sequence":"first","affiliation":[]},{"given":"Kaspars","family":"Balodis","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"26_CR1","unstructured":"Balodis, K., Beri\u0146a, A., C\u012bpola, K., Dimitrijevs, M., Iraids, J., J\u0113ri\u0146\u0161, K., Kacs, V., Kal\u0113js, J., Kri\u0161lauks, R., Luksti\u0146\u0161, K., Raumanis, R., Scegulnaja, I., Somova, N., Vanaga, A., Freivalds, R.: On the state complexity of ultrametric finite automata. In: SOFSEM 2013: Theory and Practice of Computer Science. vol.\u00a02, pp. 1\u20139 (2013)"},{"issue":"1","key":"26_CR2","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1134\/S2070046609010038","volume":"1","author":"B. Dragovich","year":"2009","unstructured":"Dragovich, B., Dragovich, A.: A p-adic model of DNA sequence and genetic code. p-Adic Numbers, Ultrametric Analysis, and Applications\u00a01(1), 34\u201341 (2009)","journal-title":"p-Adic Numbers, Ultrametric Analysis, and Applications"},{"key":"26_CR3","doi-asserted-by":"crossref","unstructured":"Freivalds, R.: Ultrametric automata and Turing machines. In: Voronkov, A. (ed.) Turing-100. EPiC Series, vol.\u00a010, pp. 98\u2013112. EasyChair (2012)","DOI":"10.29007\/tdf5"},{"issue":"3","key":"26_CR4","first-page":"99","volume":"15","author":"R. Freivalds","year":"1979","unstructured":"Freivalds, R.: Language recognition using finite probabilistic multitape and multihead automata. Problemy Peredachi Informatsii\u00a015(3), 99\u2013106 (1979) (in Russian)","journal-title":"Problemy Peredachi Informatsii"},{"key":"26_CR5","doi-asserted-by":"publisher","first-page":"93","DOI":"10.4204\/EPTCS.1.9","volume":"1","author":"M. Holzer","year":"2009","unstructured":"Holzer, M., Kutrib, M., Malcher, A.: Multi-head finite automata: Characterizations, concepts and open problems. Electronic Proceedings in Theoretical Computer Science\u00a01, 93\u2013107 (2009), http:\/\/dx.doi.org\/10.4204\/EPTCS.1.9","journal-title":"Electronic Proceedings in Theoretical Computer Science"},{"key":"26_CR6","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley (1979)"},{"key":"26_CR7","doi-asserted-by":"crossref","unstructured":"Kozyrev, S.V.: Ultrametric analysis and interbasin kinetics, pp. 121\u2013128. American Institute of Physics (2006)","DOI":"10.1063\/1.2193116"},{"key":"26_CR8","unstructured":"Kri\u0161lauks, R., Ruk\u0161\u0101ne, I., Balodis, K., Kucevalovs, I., Freivalds, R., N\u0101gele, I.: Ultrametric Turing machines with limited reversal complexity. In: SOFSEM 2013: Theory and Practice of Computer Science. vol.\u00a02, pp. 87\u201394 (2013)"},{"key":"26_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/3-540-59175-3_103","volume-title":"LATIN \u201995: Theoretical Informatics","author":"I. Macarie","year":"1995","unstructured":"Macarie, I.: Multihead two-way probabilistic finite automata. In: Baeza-Yates, R., Poblete, P.V., Goles, E. (eds.) LATIN 1995. LNCS, vol.\u00a0911, pp. 371\u2013385. Springer, Heidelberg (1995), http:\/\/dx.doi.org\/10.1007\/3-540-59175-3_103"},{"key":"26_CR10","unstructured":"Madore, D.A.: A first introduction to p-adic numbers. Online (2000), http:\/\/www.madore.org\/~david\/math\/padics.eps"},{"issue":"1","key":"26_CR11","first-page":"67","volume":"14","author":"B. Monien","year":"1980","unstructured":"Monien, B.: Two-way multihead automata over a one-letter alphabet. RAIRO - Theoretical Informatics and Applications - Informatique Thorique et Applications\u00a014(1), 67\u201382 (1980)","journal-title":"RAIRO - Theoretical Informatics and Applications - Informatique Thorique et Applications"},{"key":"26_CR12","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. Proceedings of The American Mathematical Society\u00a021, 303\u2013309 (1969)","journal-title":"Proceedings of The American Mathematical Society"},{"key":"26_CR13","unstructured":"Yao, A.C., Rivest, R.L.: k + 1 heads are better than k. vol.\u00a025, pp. 337\u2013340. ACM, New York (1978), http:\/\/doi.acm.org\/10.1145\/322063.322076"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2015: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-46078-8_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,16]],"date-time":"2025-05-16T22:17:00Z","timestamp":1747433820000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-46078-8_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662460771","9783662460788"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-46078-8_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}