Real-Time vector automata

Authors:
Özlem Salehi;Abuzer Yakaryılmaz;A. C. Cem Say
Affiliations:
Department of Computer Engineering, Boğaziçi University, Bebek, Istanbul, Turkey and Department of Mathematics, Boğaziçi University, Bebek, Istanbul, Turkey;Faculty of Computing, University of Latvia, Rīga, Latvia;Department of Computer Engineering, Boğaziçi University, Bebek, Istanbul, Turkey
Venue:
FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory
Year:
2013

Citing 4
Cited 0

Finite state verifiers I: the power of interaction

Journal of the ACM (JACM)
Probabilistic Two-Way Machines

Proceedings on Mathematical Foundations of Computer Science
Some Observations on 2-way Probabilistic Finite Automata

Proceedings of the 12th Conference on Foundations of Software Technology and Theoretical Computer Science
Real time counter machines

FOCS '67 Proceedings of the 8th Annual Symposium on Switching and Automata Theory (SWAT 1967)

Quantified Score

Hi-index	0.00

Visualization

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 k×k 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.