6533b85bfe1ef96bd12bb319
RESEARCH PRODUCT
FINITE AUTOMATA WITH ADVICE TAPES
Uğur KüçükAbuzer YakaryilmazA. C. Cem Saysubject
TheoryofComputation_COMPUTATIONBYABSTRACTDEVICESTheoretical computer scienceComputer scienceω-automatonTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESDeterministic finite automatonDeterministic automatonComputer Science (miscellaneous)Automata theoryQuantum finite automataTwo-way deterministic finite automatonNondeterministic finite automatonAdvice (complexity)AlgorithmComputer Science::Formal Languages and Automata Theorydescription
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.
year | journal | country | edition | language |
---|---|---|---|---|
2014-12-01 | International Journal of Foundations of Computer Science |