Descriptional complexity of nondeterministic finite automata

被引：0
|
作者：
Salomaa, Kai [1 ]
机构：
[1] Queens Univ, Sch Comp, Kingston, ON K7L 3N6, Canada
来源：
Developments in Language Theory, Proceedings | 2007年 / 4588卷
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
In this talk, I will survey recent results and discuss open problems on the state and transition complexity of nondeterministic finite automata.
引用
收藏
页码：31 / 35
页数：5
相关论文
共 50 条
  • [1] Nondeterministic finite automata - Recent results on the descriptional and computational complexity
    Holzer, Markus
    Kutrib, Martin
    [J]. IMPLEMENTATION AND APPLICATION OF AUTOMATA, PROCEEDINGS, 2008, 5148 : 1 - +
  • [2] NONDETERMINISTIC FINITE AUTOMATA - RECENT RESULTS ON THE DESCRIPTIONAL AND COMPUTATIONAL COMPLEXITY
    Holzer, Markus
    Kutrib, Martin
    [J]. INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2009, 20 (04) : 563 - 580
  • [3] Descriptional and Computational Complexity of Finite Automata
    Holzer, Markus
    Kutrib, Martin
    [J]. LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS, 2009, 5457 : 23 - 42
  • [4] On the Descriptional Complexity of the Direct Product of Finite Automata
    Holzer, Markus
    Rauch, Christian
    [J]. DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS, DCFS 2022, 2022, 13439 : 100 - 111
  • [5] NONDETERMINISTIC BIAUTOMATA AND THEIR DESCRIPTIONAL COMPLEXITY
    Holzer, Markus
    Jakobi, Sebastian
    [J]. INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2014, 25 (07) : 837 - 855
  • [6] More on the Descriptional Complexity of Products of Finite Automata
    Holzer, Markus
    Rauch, Christian
    [J]. DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS, DCFS 2021, 2021, 13037 : 76 - 87
  • [7] Descriptional Complexity of Finite Automata - Selected Highlights
    Salomaa, Arto
    Salomaa, Kai
    Smith, Taylor J.
    [J]. FUNDAMENTA INFORMATICAE, 2024, 191 (3-4) : 231 - 268
  • [8] Descriptional and computational complexity of finite automata-A survey
    Holzer, Markus
    Kutrib, Martin
    [J]. INFORMATION AND COMPUTATION, 2011, 209 (03) : 456 - 470
  • [9] On the descriptional complexity of finite automata with modified acceptance conditions
    Holzer, M
    Kutrib, M
    [J]. THEORETICAL COMPUTER SCIENCE, 2005, 330 (02) : 267 - 285
  • [10] Descriptional and Computational Complexity of the Circuit Representation of Finite Automata
    Valdats, Maris
    [J]. LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS (LATA 2018), 2018, 10792 : 105 - 117
12345