Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 13-19 |
| Number of pages | 7 |
| Journal | CEUR Workshop Proceedings |
| Volume | 1326 |
| Publication status | Published - 2015 |
| Event | 41st International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2015 - Pec pod Snezkou, Czech Republic Duration: 24 Jan 2015 → 29 Jan 2015 |
Fingerprint
Dive into the research topics of 'Ultrametric automata with one head versus multihead nondeterministic automata'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver