Unconventional Finite Automata and Algorithms

  title={Unconventional Finite Automata and Algorithms},
  author={Kaspars Balodis},
We investigate several unconventional models of finite automata and algorithms. We show that two-way alternating automata can be smaller than fast bounded-error probabilistic automata. We introduce ultrametric finite automata which use p-adic numbers to describe the branching process of the computation. We examine the size complexity of all the abovementioned automata for the counting problem. We also examine two-way frequency finite automata. We define ultrametric query algorithms and examine… CONTINUE READING


Publications referenced by this paper.

Ultrametric query algorithms ”

  • A. Christos
  • 2014

On the State Complexity of Ultrametric Finite Automata

  • Balodis, Kaspars
  • Theory and Applications of Models of Computation…
  • 2013

Quantum proofs for classical theorems ”

  • Kārlis Jērinš
  • 2009

A first introduction to p - adic numbers

  • A. David
  • 2000

Similar Papers

Loading similar papers…