# On the Hierarchy Classes of Finite Ultrametric Automata

@inproceedings{Krislauks2015OnTH, title={On the Hierarchy Classes of Finite Ultrametric Automata}, author={Rihards Krislauks and K. Balodis}, booktitle={SOFSEM}, year={2015} }

This paper explores the language classes that arise with respect to the head count of a finite ultrametric automaton. First we prove that in the one-way setting there is a language that can be recognized by a one-head ultrametric finite automaton and cannot be recognized by any k-head non-deterministic finite automaton. Then we prove that in the two-way setting the class of languages recognized by ultrametric finite k-head automata is a proper subclass of the class of languages recognized by (k…

## One Citation

### Ultrametric Finite Automata and Their Capabilities

- Computer ScienceBalt. J. Mod. Comput.
- 2016

A survey is presented on ultrametric automata and their language recognition capabilities and can have small number of states when classical automata require much more states.

## References

SHOWING 1-10 OF 16 REFERENCES

### Multihead two-way probabilistic finite automata

- Computer ScienceTheory of Computing Systems
- 2007

A simple formula is obtained for the maximum inherent bandwidth of the configuration transition matrices associated with thek-head probabilistic finite automata processing a length-n input string and possibilities for a space-efficient deterministic simulation of Probabilistic automata are discussed.

### Multi-Head Finite Automata: Characterizations, Concepts and Open Problems

- Computer ScienceCSP
- 2008

A tour of a vast literature on computational and descriptional complexity issues on multi-head finite automata documenting the importance of these devices and the borderline between decidable and undecidable problems is toured.

### Generalized automata and stochastic languages

- Computer Science
- 1969

This paper is concerned with the so-called generalized automata where the elements of the initial vector, of the final vector and of the matrices are allowed to be arbitrary real numbers and it is proved that a language is accepted by a generalized automaton if and only if it is acceptance by a probabilistic automaton.

### On the State Complexity of Ultrametric Finite Automata

- Computer Science
- 2012

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…

### Two-Way Multihead Automata Over a One-Letter Alphabet

- Computer ScienceRAIRO Theor. Informatics Appl.
- 1980

The classes of languages over a one-letter alphabet acceptable by deterministic {respectively nondeterministic} two-way k-headfinite automata are dénoteed and Hierarchy results are proved.

### Ultrametric automata and Turing machines

- Computer ScienceTuring-100
- 2012

We introduce a notion of ultrametric automata and Turing machines using p-adic numbers to describe random branching of the process of computation. These automata have properties similar to the…

### K + 1 heads are better than K

- Computer Science17th Annual Symposium on Foundations of Computer Science (sfcs 1976)
- 1976

There are languages which can be recognized by a deterministic (k + 1)-headed oneway finite automaton but which cannot be recognized by a k-headed one-way (deterministic or non-deterministic) finite…

### Ultrametric Turing Machines with Limited Reversal Complexity ?

- Computer Science
- 2012

It is proved that Turing machines of this type can have advantages in reversal complexity over deterministic and probabilistic Turing machines.

### SOFSEM 2013: Theory and Practice of Computer Science

- Computer ScienceLecture Notes in Computer Science
- 2013

This book constitutes the refereed proceedings of the 39th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2013, held in Spindlerův Mlýn, Czech Republic,…