FINITE AUTOMATA WITH ADVICE TAPES-Reference-Cited by-同舟云学术

FINITE AUTOMATA WITH ADVICE TAPES

Published:2014-12 Issue:08 Volume:25 Page:987-1000
ISSN:0129-0541
Container-title:International Journal of Foundations of Computer Science
language:en
Short-container-title:Int. J. Found. Comput. Sci.

Author:

KÜÇÜK UĞUR¹,SAY A. C. CEM¹,YAKARYILMAZ ABUZER²³

Affiliation:

1. Computer Engineering Department, Boğaziçi University, Bebek 34342, Istanbul, Turkey

2. Faculty of Computing, University of Latvia, Raina bulv. 19, LV-1586, Rīga, Latvia

3. National Laboratory for Scientific Computing, Petrópolis, RJ, 25651-075, Brazil

Abstract

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.

Publisher

World Scientific Pub Co Pte Lt

Subject

Computer Science (miscellaneous)

Link

https://www.worldscientific.com/doi/pdf/10.1142/S012905411440019X

Reference13 articles.

1. Finite state verifiers I

2. Amount of nonconstructivity in deterministic finite automata

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Two-Way Non-Uniform Finite Automata;International Journal of Foundations of Computer Science;2022-12-12

2. Advice hierarchies among finite automata;Information and Computation;2022-10

3. Two-Way Non-uniform Finite Automata;Developments in Language Theory;2021

4. Determinism and Nondeterminism in Finite Automata with Advice;Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications;2018