@inproceedings{bea448be40e94deb88b0dd63b3647eef,
title = "Capabilities of ultrametric automata with one, two, and three states",
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.",
author = "Maksims Dimitrijevs",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2016.; 42nd International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2016 ; Conference date: 23-01-2016 Through 28-01-2016",
year = "2016",
doi = "10.1007/978-3-662-49192-8\_21",
language = "English",
isbn = "9783662491911",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "253--264",
editor = "Freivalds, \{Rūsiņ{\v s} Mārtiņ{\v s}\} and Gregor Engels and Barbara Catania",
booktitle = "SOFSEM 2016",
address = "Germany",
}