Deterministic blow-ups of minimal nondeterministic finite automata over a fixed alphabet

被引：0
|
作者：
Jirasek, Jozef [1 ]
Jiraskova, Calina [2 ]
Szabari, Alexander [1 ]
机构：
[1] Safarik Univ, Inst Comp Sci, Jesenna 5, Kosice 04154, Slovakia
[2] Slovak Acad Sci, Math Inst, Kosice, Slovakia
来源：
DEVELOPMENTS IN LANGUAGE THEORY, PROCEEDINGS | 2007年 / 4588卷
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We show that for all integers n and alpha such that n <= alpha <= 2(n), there exists a minimal nondeterministic finite automaton of n states with a four-letter input alphabet whose equivalent minimal deterministic finite automaton has exactly a states. It follows that in the case of a four-letter alphabet, there are no "magic numbers", i.e., the holes in the hierarchy. This improves a similar result obtained by Geffert for a growing alphabet of size n + 2.
引用
收藏
页码：254 / +
页数：3
相关论文
共 47 条
  • [21] An incremental algorithm for constructing minimal deterministic finite cover automata
    Campeanu, C
    Paun, A
    Smith, JR
    [J]. IMPLEMENTATION AND APPLICATION OF AUTOMATA, 2006, 3845 : 90 - 103
  • [22] Construction of minimal deterministic finite automata from biological motifs
    Marschall, Tobias
    [J]. THEORETICAL COMPUTER SCIENCE, 2011, 412 (8-10) : 922 - 930
  • [23] A bound of the number of weighted blow-ups to compute the minimal log discrepancy for smooth 3-folds
    Ishii, Shihoko
    [J]. MATHEMATICAL PROCEEDINGS OF THE CAMBRIDGE PHILOSOPHICAL SOCIETY, 2024, 176 (03) : 495 - 515
  • [24] Limitations of non-deterministic finite automata imposed by one letter input alphabet
    Mancinska, L
    Ozols, N
    Praude, R
    Zalcmane, A
    [J]. FCS '05: PROCEEDINGS OF THE 2005 INTERNATIONAL CONFERENCE ON FOUNDATIONS OF COMPUTER SCIENCE, 2005, : 161 - 166
  • [25] A fast and simple algorithm for constructing minimal acyclic deterministic finite automata
    Watson, BW
    [J]. JOURNAL OF UNIVERSAL COMPUTER SCIENCE, 2002, 8 (02): : 363 - 367
  • [26] The number of similarity relations and the number of minimal deterministic finite cover automata
    Câmpeanu, C
    Paun, A
    [J]. IMPLEMENTATION AND APPLICATION OF AUTOMATA, 2003, 2608 : 67 - 76
  • [27] Antichain-based universality and inclusion testing over nondeterministic finite tree automata
    Bouajjani, Ahmed
    Habermehl, Peter
    Holik, Lukas
    Touili, Tayssir
    Vojnar, Tomas
    [J]. IMPLEMENTATION AND APPLICATION OF AUTOMATA, PROCEEDINGS, 2008, 5148 : 57 - +
  • [28] Conditions for Minimal Fuzzy Deterministic Finite Automata via Brzozowski's Procedure
    Gonzalez de Mendivil, Jose R.
    [J]. IEEE TRANSACTIONS ON FUZZY SYSTEMS, 2018, 26 (04) : 2409 - 2420
  • [29] Query Learning of Minimal Deterministic Symbolic Finite Automata Separating Regular Languages
    Kawasaki, Yoshito
    Hendrian, Diptarama
    Yoshinaka, Ryo
    Shinohara, Ayumi
    [J]. SOFSEM 2024: THEORY AND PRACTICE OF COMPUTER SCIENCE, 2024, 14519 : 340 - 354
  • [30] CHARACTERISTICS OF FIXED POINTS FOR LINEAR AUTOMATA OVER A FINITE RING
    Skobelev, V. V.
    [J]. PRIKLADNAYA DISKRETNAYA MATEMATIKA, 2008, 1 (01): : 126 - 130
12345