Abstract
We consider two-tape automata where one tape contains the input word w, and the other contains an advice string \(\alpha (|w|)\) for some function \(\alpha :\mathbb {N}\rightarrow \varSigma ^*\). Such an automaton recognizes a language L if there is an advice function for which every word on the input tape is correctly classified. This model has been introduced by Küçük with the aim to model non-uniform computation on finite automata. So far, most of the results concerned automata whose tapes are both 1-way. First, we show that making even one of the tapes 2-way increases the model’s power. Then we turn our attention to the case of both tapes being 2-way, which can also be viewed as a restricted version of the non-uniform families of automata used by Ibarra and Ravikumar to define the class \(\mathsf{NUDSPACE}\). We show this restriction to be not very significant since, e. g., , i. e., languages recognized by automata with 2-way input and advice tape with polynomial advice equals \(\mathsf{NUDSPACE} (O(\log (n)))\). Hence, we can show that many interesting problems concerning the state complexity of families of automata carry over to the problems concerning advice size of non-uniform automata. In particular, the question whether there can be a more than polynomial gap in advice between determinism and non-determinism is of great interest: e. g., the existence of a language that can be recognized by some 2-way NFA with some k heads on the advice tape and with polynomial (resp. logarithmic) advice, while a corresponding 2-head DFA would need exponential (resp. polynomial) advice, would imply \(\mathsf {L\not =NL}\) (resp. \(\mathsf {LL\not =NLL}\)). We show that for advice of size \((\log n)^{o(1)}\) there is no gap between determinism and non-determinism. In general, we can show that the gap is not more than exponential.
R. Královič—The research has been supported by the grant 1/0601/20 of the Slovak Scientific Grant Agency VEGA.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Damm, C., Holzer, M.: Automata that take advice. In: Wiedermann, J., Hájek, P. (eds.) MFCS 1995. LNCS, vol. 969, pp. 149–158. Springer, Heidelberg (1995). https://doi.org/10.1007/3-540-60246-1_121
Ďuriš, P., Korbaš, R., Královič, R., Královič, R.: Determinism and nondeterminism in finite automata with advice. In: Böckenhauer, H.-J., Komm, D., Unger, W. (eds.) Adventures Between Lower Bounds and Higher Altitudes. LNCS, vol. 11011, pp. 3–16. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-98355-4_1
Ďuriš, P., Královič, R., Královič, R., Pardubská, D., Pašen, M., Rossmanith, P.: Randomization in non-uniform finite automata. In: Esparza, J., Král’, D. (eds.) 45th International Symposium on Mathematical Foundations of Computer Science, MFCS 2020, 24–28 August 2020, Prague, Czech Republic. LIPIcs, vol. 170, pp. 30:1–30:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
Fischer, P.C., Rosenberg, A.L.: Multitape one-way nonwriting automata. J. Comput. Syst. Sci. 2(1), 88–101 (1968)
Freivalds, R.: Amount of nonconstructivity in deterministic finite automata. Theor. Comput. Sci. 411(38–39), 3436–3443 (2010)
Hopcroft, J.E., Ullman, J.D.: Some results on tape-bounded Turing machines. J. ACM 16(1), 168–177 (1969)
Ibarra, O.H., Ravikumar, B.: Sublogarithmic-space Turing machines, nonuniform space complexity, and closure properties. Math. Syst. Theory 21(1), 1–17 (1988)
Kapoutsis, C.A.: Minicomplexity. J. Autom. Lang. Comb. 17(2–4), 205–224 (2012)
Kapoutsis, C.A.: Two-way automata versus logarithmic space. Theory Comput. Syst. 55(2), 421–447 (2014)
Karp, R.M., Lipton, R.J.: Turing machines that take advice. Enseignement Math-ématique 28(2), 191–209 (1982)
Küçük, U., Say, A.C.C., Yakaryilmaz, A.: Finite automata with advice tapes. Int. J. Found. Comput. Sci. 25(8), 987–1000 (2014)
Tadaki, K., Yamakami, T., Lin, J.C.H.: Theory of one-tape linear-time Turing machines. Theor. Comput. Sci. 411(1), 22–43 (2010)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Frei, F., Hromkovič, J., Královič, R., Královič, R. (2021). Two-Way Non-uniform Finite Automata. In: Moreira, N., Reis, R. (eds) Developments in Language Theory. DLT 2021. Lecture Notes in Computer Science(), vol 12811. Springer, Cham. https://doi.org/10.1007/978-3-030-81508-0_13
Download citation
DOI: https://doi.org/10.1007/978-3-030-81508-0_13
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-81507-3
Online ISBN: 978-3-030-81508-0
eBook Packages: Computer ScienceComputer Science (R0)