Skip to main content
SpringerLink
Log in
Book cover

International Conference on Current Trends in Theory and Practice of Informatics

SOFSEM 2019: SOFSEM 2019: Theory and Practice of Computer Science pp 28–38Cite as

Minicomplexity

Some Motivation, Some History, and Some Structure (Invited Talk Extended Abstract)

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 11376))

Abstract

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.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  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). https://doi.org/10.1007/978-3-642-02737-6_4

    Chapter  Google Scholar 

  2. Kapoutsis, C.A.: Minicomplexity. In: Kutrib, M., Moreira, N., Reis, R. (eds.) DCFS 2012. LNCS, vol. 7386, pp. 20–42. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-31623-4_2

    Chapter  Google Scholar 

  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)

    Article  MathSciNet  Google Scholar 

  4. Kapoutsis, C., Pighizzini, G.: Two-way automata characterizations of L/poly versus NL. Theory Comput. Syst. 56, 662–685 (2015)

    Article  MathSciNet  Google Scholar 

  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. Sakoda, W.J., Sipser, M.: Nondeterminism and the size of two-way finite automata. In: Proceedings of STOC, pp. 275–286 (1978)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Carnegie Mellon University in Qatar, Doha, Qatar

    Christos A. Kapoutsis

Authors
  1. Christos A. Kapoutsis
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Christos A. Kapoutsis .

Editor information

Editors and Affiliations

  1. University of Genoa, Genoa, Italy

    Barbara Catania

  2. Comenius University, Bratislava, Slovakia

    Rastislav Královič

  3. Poznań University of Technology, Poznań, Poland

    Jerzy Nawrocki

  4. Università degli Studi di Milano, Milan, Italy

    Giovanni Pighizzini

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Kapoutsis, C.A. (2019). Minicomplexity. In: Catania, B., Královič, R., Nawrocki, J., Pighizzini, G. (eds) SOFSEM 2019: Theory and Practice of Computer Science. SOFSEM 2019. Lecture Notes in Computer Science(), vol 11376. Springer, Cham. https://doi.org/10.1007/978-3-030-10801-4_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-10801-4_3

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-10800-7

  • Online ISBN: 978-3-030-10801-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation