6533b7d5fe1ef96bd126484b

RESEARCH PRODUCT

Finite automata with advice tapes

U��ur K������kA. C. Cem SayAbuzer Yakary��lmaz

subject

FOS: Computer and information sciencesTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESTheoryofComputation_COMPUTATIONBYABSTRACTDEVICESFormal Languages and Automata Theory (cs.FL)Computer Science - Formal Languages and Automata TheoryNonlinear Sciences::Cellular Automata and Lattice GasesComputer Science::Formal Languages and Automata Theory

description

We define a model of advised computation by finite automata where the advice is provided on a separate tape. We consider several variants of the model where the advice is deterministic or randomized, the input tape head is allowed real-time, one-way, or two-way access, and the automaton is classical or quantum. We prove several separation results among these variants, demonstrate an infinite hierarchy of language classes recognized by automata with increasing advice lengths, and establish the relationships between this and the previously studied ways of providing advice to finite automata.

yearjournalcountryeditionlanguage
2013-12-08
http://arxiv.org/abs/1312.2268