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 条
  • [41] Removing bidirectionality from nondeterministic finite automata
    Kapoutsis, C
    [J]. MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2005, PROCEEDINGS, 2005, 3618 : 544 - 555
  • [42] Computational and Descriptional Power of Nondeterministic Iterated Uniform Finite-State Transducers
    Kutrib, Martin
    Malcher, Andreas
    Mereghetti, Carlo
    Palano, Beatrice
    [J]. FUNDAMENTA INFORMATICAE, 2022, 185 (04) : 337 - 356
  • [43] LANGUAGES RECOGNIZED BY NONDETERMINISTIC QUANTUM FINITE AUTOMATA
    Yakaryilmaz, Abuzer
    Say, A. C. Cem
    [J]. QUANTUM INFORMATION & COMPUTATION, 2010, 10 (9-10) : 747 - 770
  • [44] Converting finite width AFAs to nondeterministic and universal finite automata
    Zakzok, Mohammad
    Salomaa, Kai
    [J]. THEORETICAL COMPUTER SCIENCE, 2024, 996
  • [45] A Novel Stream Cipher Based on Nondeterministic Finite Automata
    Khaleel, Ghassan
    Turaev, Sherzod
    Zhukabayeva, Tamara
    [J]. PROCEEDINGS OF THE 2016 CONFERENCE ON INFORMATION TECHNOLOGIES IN SCIENCE, MANAGEMENT, SOCIAL SPHERE AND MEDICINE (ITSMSSM), 2016, 51 : 110 - 115
  • [46] A lower bound technique for the size of nondeterministic finite automata
    Glaister, I
    Shallit, J
    [J]. INFORMATION PROCESSING LETTERS, 1996, 59 (02) : 75 - 77
  • [47] Robust models to infer flexible nondeterministic finite automata
    Jastrzab, Tomasz
    Lardeux, Frederic
    Monfroy, Eric
    [J]. JOURNAL OF COMPUTATIONAL SCIENCE, 2024, 79
  • [48] Deterministic and Nondeterministic Iterated Uniform Finite-State Transducers: Computational and Descriptional Power
    Kutrib, Martin
    Malcher, Andreas
    Mereghetti, Carlo
    Palano, Beatrice
    [J]. BEYOND THE HORIZON OF COMPUTABILITY, CIE 2020, 2020, 12098 : 87 - 99
  • [49] A Supervisor Synthesis Tool for Finite Nondeterministic Automata with Data
    Kirilov, Aleksandar
    Martinovikj, Darko
    Mishevski, Kristijan
    Petkovska, Marija
    Trajcheska, Zlatka
    Markovski, Jasen
    [J]. SOFTWARE ENGINEERING AND FORMAL METHODS, 2014, 8368 : 101 - 112
  • [50] On input-revolving deterministic and nondeterministic finite automata
    Bensch, Suna
    Bordihn, Henning
    Holzer, Markus
    Kutrib, Martin
    [J]. INFORMATION AND COMPUTATION, 2009, 207 (11) : 1140 - 1155
12345