Advertisement

One Alternation Can Be More Powerful Than Randomization in Small and Fast Two-Way Finite Automata

  • Kaspars Balodis
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8070)

Abstract

We show a family of languages that can be recognized by a family of linear-size alternating one-way finite automata with one alternation but cannot be recognized by any family of polynomial-size bounded-error two-way probabilistic finite automata with the expected runtime bounded by a polynomial. In terms of finite automata complexity theory this means that neither 1Σ2 nor 1Π2 is contained in 2P 2.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Chandra, A.K., Kozen, D.C., Stockmeyer, L.J.: Alternation. J. ACM 28(1), 114–133 (1981)MathSciNetzbMATHCrossRefGoogle Scholar
  2. 2.
    Chrobak, M.: Finite automata and unary languages. Theoretical Computer Science 47(0), 149–158 (1986)MathSciNetzbMATHCrossRefGoogle Scholar
  3. 3.
    Geffert, V.: An alternating hierarchy for finite automata. Theoretical Computer Science 445, 1–24 (2012)MathSciNetzbMATHCrossRefGoogle Scholar
  4. 4.
    Hromkovič, J., Schnitger, G.: On the power of las vegas ii. two-way finite automata. In: Wiedermann, J., Van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol. 1644, pp. 433–442. Springer, Heidelberg (1999)CrossRefGoogle Scholar
  5. 5.
    Kapoutsis, C.A.: Size complexity of two-way finite automata. In: Diekert, V., Nowotka, D. (eds.) DLT 2009. LNCS, vol. 5583, pp. 47–66. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  6. 6.
    Kapoutsis, C.A.: Minicomplexity. In: Kutrib, M., Moreira, N., Reis, R. (eds.) DCFS 2012. LNCS, vol. 7386, pp. 20–42. Springer, Heidelberg (2012)CrossRefGoogle Scholar
  7. 7.
    Kapoutsis, C.A., Královič, R., Mömke, T.: An exponential gap between LasVegas and deterministic sweeping finite automata. In: Hromkovič, J., Královič, R., Nunkesser, M., Widmayer, P. (eds.) SAGA 2007. LNCS, vol. 4665, pp. 130–141. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  8. 8.
    Kapoutsis, C.A., Královič, R., Mömke, T., Královic, R.: Size complexity of rotating and sweeping automata. Journal of Computer and System Sciences 78(2), 537–558 (2012)MathSciNetzbMATHCrossRefGoogle Scholar
  9. 9.
    Sakoda, W.J., Sipser, M.: Nondeterminism and the size of two way finite automata. In: Proceedings of the Tenth Annual ACM Symposium on Theory of Computing, STOC 1978, pp. 275–286. ACM, New York (1978)CrossRefGoogle Scholar
  10. 10.
    Sipser, M.: Introduction to the Theory of Computation, 2nd edn. Thomson Course Technology (2006)Google Scholar
  11. 11.
    Yakaryılmaz, A., Say, C.: Succinctness of two-way probabilistic and quantum finite automata. Discrete Mathematics & Theoretical Computer Science 12(4), 19–40 (2010)MathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Kaspars Balodis
    • 1
  1. 1.Faculty of ComputingUniversity of LatviaRigaLatvia

Personalised recommendations