Some Motivation, Some History, and Some Structure (Invited Talk Extended Abstract)
  • Christos A. KapoutsisEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11376)


The term minicomplexity was first suggested in [2], as a name for the field of theory of computation which studies the size complexity of two-way finite automata, as outlined in [1]. In this talk, we discuss the motivation behind this field and enumerate some of its prominent results in their historical context. By reformulating these results, we then attempt to reveal additional structure which often passes unnoticed. The present report records the start of this attempt.


  1. 1.
    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). Scholar
  2. 2.
    Kapoutsis, C.A.: Minicomplexity. In: Kutrib, M., Moreira, N., Reis, R. (eds.) DCFS 2012. LNCS, vol. 7386, pp. 20–42. Springer, Heidelberg (2012). Scholar
  3. 3.
    Kapoutsis, C., Královič, R., Mömke, T.: Size complexity of rotating and sweeping automata. J. Comput. Syst. Sci. 78(2), 537–558 (2012)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Kapoutsis, C., Pighizzini, G.: Two-way automata characterizations of L/poly versus NL. Theory Comput. Syst. 56, 662–685 (2015)MathSciNetCrossRefGoogle Scholar
  5. 5.
    Meyer, A.R., Fischer, M.J.: Economy of description by automata, grammars, and formal systems. In: Proceedings of FOCS, pp. 188–191 (1971)Google Scholar
  6. 6.
    Sakoda, W.J., Sipser, M.: Nondeterminism and the size of two-way finite automata. In: Proceedings of STOC, pp. 275–286 (1978)Google Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.Carnegie Mellon University in QatarDohaQatar

Personalised recommendations