Ultrametric Automata with One Head Versus Multihead Nondeterministic Automata

Maksims Dimitrijevs, Irina Scegulnaja
2015 Conference on Current Trends in Theory and Practice of Informatics  
The idea of using p-adic numbers in Turing machines and finite automata to describe random branching of the process of computation was recently introduced. In the last two years some advantages of ultrametric algorithms for finite automata and Turing machines were explored. In this paper advantages of ultrametric automata with one head versus multihead deterministic and nondeterministic automata are observed.
dblp:conf/sofsem/DimitrijevsS15 fatcat:nwqjp7k5mbcljlchtq5pbcrajm