Real-Time Vector Automata
Formal Languages and Automata Theory
2016-09-09 v1 Computational Complexity
Abstract
We study the computational power of real-time finite automata that have been augmented with a vector of dimension k, and programmed to multiply this vector at each step by an appropriately selected matrix. Only one entry of the vector can be tested for equality to 1 at any time. Classes of languages recognized by deterministic, nondeterministic, and "blind" versions of these machines are studied and compared with each other, and the associated classes for multicounter automata, automata with multiplication, and generalized finite automata.
Cite
@article{arxiv.1303.6129,
title = {Real-Time Vector Automata},
author = {Özlem Salehi and Abuzer Yakaryılmaz and A. C. Cem Say},
journal= {arXiv preprint arXiv:1303.6129},
year = {2016}
}
Comments
14 pages