{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T01:53:20Z","timestamp":1725846800462},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662491911"},{"type":"electronic","value":"9783662491928"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-662-49192-8_21","type":"book-chapter","created":{"date-parts":[[2016,1,7]],"date-time":"2016-01-07T15:47:27Z","timestamp":1452181647000},"page":"253-264","source":"Crossref","is-referenced-by-count":1,"title":["Capabilities of Ultrametric Automata with One, Two, and Three States"],"prefix":"10.1007","author":[{"given":"Maksims","family":"Dimitrijevs","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,1,8]]},"reference":[{"key":"21_CR1","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":"21_CR2","unstructured":"Balodis, K., Berina, A., C\u012bpola, K., Dimitrijevs, M., Iraids, J., et al.: On the State Complexity of Ultrametric Finite Automata. In: SOFSEM 2013, Proceedings, vol. 2, pp. 1\u20139, \u0160pindler\u016fv Ml\u1ef3n (2013)"},{"key":"21_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/978-3-319-13350-8_1","volume-title":"Computing with New Resources","author":"K Balodis","year":"2014","unstructured":"Balodis, K.: Counting with probabilistic and ultrametric finite automata. In: Calude, C.S., Freivalds, R., Kazuo, I. (eds.) Gruska Festschrift. LNCS, vol. 8808, pp. 3\u201316. Springer, Heidelberg (2014)"},{"key":"21_CR4","unstructured":"Dimitrijevs, M., \u0160\u010degul\u0327naja, I., Freivalds, R.: Complexity Advantages of Ultrametric Machines. In: SOFSEM 2014, Proceedings, vol. 2, pp. 21\u201329, Nov\u00fd Smokovec (2014)"},{"key":"21_CR5","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. Proceedings, vol. 2, pp. 87\u201394, \u0160pindler\u016fv Ml\u1ef3n (2013)"},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"Kozyrev, S.V.: Ultrametric analysis and interbasin kinetics. In: 2nd International Conference on p-Adic Mathematical Physics, American Institute of Physics, pp. 121\u2013128 (2006)","DOI":"10.1063\/1.2193116"},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"Vladimirov, V.S., Volovich, I.V., Zelenov, E.I.: P-Adic Analysis and Mathematical Physics. World Scientific (1995)","DOI":"10.1142\/1581"},{"key":"21_CR8","unstructured":"Madore, D.A.: A first introduction to p-adic numbers. \n                      http:\/\/www.madore.org\/david\/math\/padics.pdf"},{"issue":"3","key":"21_CR9","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1016\/S0019-9958(63)90290-0","volume":"6","author":"MO Rabin","year":"1963","unstructured":"Rabin, M.O.: Probabilistic Automata. Inf. Control 6(3), 230\u2013245 (1963)","journal-title":"Inf. Control"},{"key":"21_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/3-540-47849-3_31","volume-title":"SOFSEM\u201999: Theory and Practice of Informatics","author":"M Kravtsev","year":"1999","unstructured":"Kravtsev, M.: Quantum finite one-counter automata. In: Bartosek, M., Tel, G., Pavelka, J. (eds.) SOFSEM 1999. LNCS, vol. 1725, pp. 431\u2013440. Springer, Heidelberg (1999)"},{"key":"21_CR11","doi-asserted-by":"publisher","first-page":"7174","DOI":"10.1007\/978-0-387-30440-3_428","volume-title":"Encyclopedia of Complexity and Systems Science","author":"J Watrous","year":"2009","unstructured":"Watrous, J.: Quantum computational complexity. In: Meyers, R.A. (ed.) Encyclopedia of Complexity and Systems Science, pp. 7174\u20137201. Springer, New York (2009)"},{"key":"21_CR12","doi-asserted-by":"crossref","unstructured":"Dimitrijevs, M.: Ultrametric Finite Automata for Turing Machine Tasks of Various Complexity. Submitted (2015)","DOI":"10.22364\/bjmc.2016.4.4.19"},{"key":"21_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1007\/978-3-319-08846-4_24","volume-title":"Implementation and Application of Automata","author":"J Rashid","year":"2014","unstructured":"Rashid, J., Yakary\u0131lmaz, A.: Implications of quantum automata for contextuality. In: Holzer, M., Kutrib, M. (eds.) CIAA 2014. LNCS, vol. 8587, pp. 318\u2013331. Springer, Heidelberg (2014)"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2016: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-49192-8_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T09:10:32Z","timestamp":1559380232000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-49192-8_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662491911","9783662491928"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-49192-8_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}