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 x 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. © 2013 Springer-Verlag.
Author supplied keywords
Cite
CITATION STYLE
Salehi, Ö., Yakaryilmaz, A., & Say, A. C. C. (2013). Real-time vector automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8070 LNCS, pp. 293–304). https://doi.org/10.1007/978-3-642-40164-0_28
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
