6533b829fe1ef96bd128ad08

RESEARCH PRODUCT

Real-Time Vector Automata

��Zlem SalehiAbuzer Yakary��lmazA. C. Cem Say

subject

FOS: Computer and information sciencesComputer Science - Computational ComplexityTheoryofComputation_COMPUTATIONBYABSTRACTDEVICESFormal Languages and Automata Theory (cs.FL)Computer Science - Formal Languages and Automata TheoryComputational Complexity (cs.CC)Nonlinear Sciences::Cellular Automata and Lattice GasesComputer Science::Formal Languages and Automata Theory

description

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 \times 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.

yearjournalcountryeditionlanguage
2013-03-25
10.1007/978-3-642-40164-0_28http://arxiv.org/abs/1303.6129