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

被引:0
|
作者
Kapoutsis, Christos A. [1 ]
机构
[1] Carnegie Mellon Univ Qatar, Doha, Qatar
关键词
SIZE COMPLEXITY;
D O I
10.1007/978-3-030-10801-4_3
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
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.
引用
收藏
页码:28 / 38
页数:11
相关论文
共 50 条
  • [1] Crypto Engineering: Some History and Some Case Studies (Extended Abstract)
    Paar, Christof
    [J]. CRYPTOGRAPHIC HARDWARE AND EMBEDDED SYSTEMS - CHES 2009, PROCEEDINGS, 2009, 5747 : 220 - 224
  • [2] Some strategies for proving theorems with a model checker abstract of invited talk
    McMillan, KL
    [J]. 15TH ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, PROCEEDINGS, 2000, : 305 - 306
  • [3] Some unusual eigenvalue problems - Invited talk
    Bai, ZJ
    Golub, GH
    [J]. VECTOR AND PARALLEL PROCESSING - VECPAR'98, 1999, 1573 : 4 - 19
  • [4] Some elements of machine learning (Extended abstract)
    Quinlan, JR
    [J]. MACHINE LEARNING, PROCEEDINGS, 1999, : 523 - 525
  • [5] Some elements of machine learning - (Extended abstract)
    Quinlan, JR
    [J]. INDUCTIVE LOGIC PROGRAMMING, 1999, 1634 : 15 - 18
  • [6] Normalization of Some Extended Abstract State Machines
    Cegielski, Patrick
    Guessarian, Irene
    [J]. FIELDS OF LOGIC AND COMPUTATION: ESSAYS DEDICATED TO YURI GUREVICH ON THE OCCASION OF HIS 70TH BIRTHDAY, 2010, 6300 : 165 - +
  • [7] Some Wellfounded Trees in UniMath Extended Abstract
    Ahrens, Benedikt
    Mortberg, Anders
    [J]. MATHEMATICAL SOFTWARE, ICMS 2016, 2016, 9725 : 9 - 17
  • [8] Security with Noisy Data (Extended Abstract of Invited Talk)
    Skoric, Boris
    [J]. INFORMATION HIDING, 2010, 6387 : 48 - 50
  • [9] Some Challenges for Software Testing Research (Invited Talk Paper)
    Alshahwan, Nadia
    Ciancone, Andrea
    Harman, Mark
    Jia, Yue
    Mao, Ke
    Marginean, Alexandru
    Mols, Alexander
    Peleg, Hila
    Sarro, Federica
    Zorin, Ilya
    [J]. PROCEEDINGS OF THE 28TH ACM SIGSOFT INTERNATIONAL SYMPOSIUM ON SOFTWARE TESTING AND ANALYSIS (ISSTA '19), 2019, : 1 - 3
  • [10] Some Thoughts on Using Argumentation to Handle Trust (Invited Talk)
    Parsons, Simon
    Tang, Yuqing
    Cai, Kai
    Sklar, Elizabeth
    McBurney, Peter
    [J]. COMPUTATIONAL LOGIC IN MULTI-AGENT SYSTEMS, 2011, 6814 : 1 - 12