Skip to main content
SpringerLink
Log in

Capabilities of Ultrametric Automata with One, Two, and Three States

  • Conference paper
  • First Online:
SOFSEM 2016: Theory and Practice of Computer Science (SOFSEM 2016)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9587))

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. 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)

    Chapter  Google Scholar 

  2. 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)

    Google Scholar 

  3. 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)

    Google Scholar 

  4. Dimitrijevs, M., Ščeguļnaja, I., Freivalds, R.: Complexity Advantages of Ultrametric Machines. In: SOFSEM 2014, Proceedings, vol. 2, pp. 21–29, Nový Smokovec (2014)

    Google Scholar 

  5. 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)

    Google Scholar 

  6. 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)

    Google Scholar 

  7. Vladimirov, V.S., Volovich, I.V., Zelenov, E.I.: P-Adic Analysis and Mathematical Physics. World Scientific (1995)

    Google Scholar 

  8. Madore, D.A.: A first introduction to p-adic numbers. http://www.madore.org/david/math/padics.pdf

  9. Rabin, M.O.: Probabilistic Automata. Inf. Control 6(3), 230–245 (1963)

    Article  MATH  Google Scholar 

  10. 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)

    Chapter  Google Scholar 

  11. Watrous, J.: Quantum computational complexity. In: Meyers, R.A. (ed.) Encyclopedia of Complexity and Systems Science, pp. 7174–7201. Springer, New York (2009)

    Chapter  Google Scholar 

  12. Dimitrijevs, M.: Ultrametric Finite Automata for Turing Machine Tasks of Various Complexity. Submitted (2015)

    Google Scholar 

  13. 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)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Computing, University of Latvia, Raiņa bulvāris 19, Riga, LV-1586, Latvia

    Maksims Dimitrijevs

Authors
  1. Maksims Dimitrijevs
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Maksims Dimitrijevs .

Editor information

Editors and Affiliations

  1. University of Latvia, Riga, Latvia

    Rūsiņš Mārtiņš Freivalds

  2. University of Paderborn, Paderborn, Germany

    Gregor Engels

  3. University of Genoa, Genoa, Italy

    Barbara Catania

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics

Search

Navigation