Paper Info
Title
Ultrametric Finite Automata and Their Capabilities.
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 recognize complex languages and can have small number of states when classical automata require much more states. In this paper, we present a survey on ultrametric automata and their language recognition capabilities.
Year
DOI
Venue
2016
10.22364/bjmc.2016.4.4.19
BALTIC JOURNAL OF MODERN COMPUTING
Keywords
DocType
Volume
Ultrametric automata,p-adic numbers,complexity
Journal
4
Issue
ISSN
Citations 
4
2255-8942
0
PageRank 
References 
Authors
0.34
0
2
Name
Order
Citations
PageRank
Maksims Dimitrijevs100.34
Kristine Cipola200.34