We introduce a notion of ultrametric finite automata using p-adic numbers to describe random branching of the process of computation. These automata have properties similar to the properties of probabilistic automata but the descriptional power of probabilistic automata and ultrametric automata can differ very much.

Ultrametric algorithms are similar to probabilistic algorithms but they describe the degree of indeterminism by p-adic numbers instead of real numbers. No wonder that only very few examples of advantages for ultrametric algorithms over probabilistic ones have been published up to now, and all they are slightly artificial. This paper considers ultrametric… (More)

Finite automata are a well known topic in computer science. Automata read words in a given alphabet and determine if those words belong to a specific formal language. They have been the subject of lots of research, and much is known about their capabilities. Parallelism in automata systems consisting of multiple automata that read the same word is far less… (More)