Abstract
Ultrametric automata use p-adic numbers to describe the random branching of the process of computation. Previous research has shown that ultrametric automata can have a significant decrease in computing complexity. In this paper we consider the languages that can be recognized by one-way ultrametric automata with one, two, and three states. We also show an example of a promise problem that can be solved by ultrametric integral automaton with three states.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Freivalds, R.: Ultrametric finite automata and turing machines. In: Béal, M.-P., Carton, O. (eds.) DLT 2013. LNCS, vol. 7907, pp. 1–11. Springer, Heidelberg (2013)
Balodis, K., Berina, A., Cīpola, K., Dimitrijevs, M., Iraids, J., et al.: On the State Complexity of Ultrametric Finite Automata. In: SOFSEM 2013, Proceedings, vol. 2, pp. 1–9, Špindlerův Mlỳn (2013)
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–16. Springer, Heidelberg (2014)
Dimitrijevs, M., Ščeguļnaja, I., Freivalds, R.: Complexity Advantages of Ultrametric Machines. In: SOFSEM 2014, Proceedings, vol. 2, pp. 21–29, Nový Smokovec (2014)
Krišlauks, R., Rukšāne, I., Balodis, K., Kucevalovs, I., Freivalds, R., Nāgele, I.: Ultrametric Turing Machines with Limited Reversal Complexity. In: SOFSEM 2013. Proceedings, vol. 2, pp. 87–94, Špindlerův Mlỳn (2013)
Kozyrev, S.V.: Ultrametric analysis and interbasin kinetics. In: 2nd International Conference on p-Adic Mathematical Physics, American Institute of Physics, pp. 121–128 (2006)
Vladimirov, V.S., Volovich, I.V., Zelenov, E.I.: P-Adic Analysis and Mathematical Physics. World Scientific (1995)
Madore, D.A.: A first introduction to p-adic numbers. http://www.madore.org/david/math/padics.pdf
Rabin, M.O.: Probabilistic Automata. Inf. Control 6(3), 230–245 (1963)
Kravtsev, M.: Quantum finite one-counter automata. In: Bartosek, M., Tel, G., Pavelka, J. (eds.) SOFSEM 1999. LNCS, vol. 1725, pp. 431–440. Springer, Heidelberg (1999)
Watrous, J.: Quantum computational complexity. In: Meyers, R.A. (ed.) Encyclopedia of Complexity and Systems Science, pp. 7174–7201. Springer, New York (2009)
Dimitrijevs, M.: Ultrametric Finite Automata for Turing Machine Tasks of Various Complexity. Submitted (2015)
Rashid, J., Yakaryılmaz, A.: Implications of quantum automata for contextuality. In: Holzer, M., Kutrib, M. (eds.) CIAA 2014. LNCS, vol. 8587, pp. 318–331. Springer, Heidelberg (2014)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dimitrijevs, M. (2016). Capabilities of Ultrametric Automata with One, Two, and Three States. In: Freivalds, R., Engels, G., Catania, B. (eds) SOFSEM 2016: Theory and Practice of Computer Science. SOFSEM 2016. Lecture Notes in Computer Science(), vol 9587. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-49192-8_21
Download citation
DOI: https://doi.org/10.1007/978-3-662-49192-8_21
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-49191-1
Online ISBN: 978-3-662-49192-8
eBook Packages: Computer ScienceComputer Science (R0)