ON FINITE AUTOMATA WITH LIMITED NONDETERMINISM (EXTENDED ABSTRACT)

被引：0
|
作者：
LEUNG, H
机构：
来源：
LECTURE NOTES IN COMPUTER SCIENCE | 1992年 / 629卷
关键词：
D O I：
暂无
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
We develop a new algorithm for determining if a given nondeterministic finite automaton is limited in nondeterminism. From this, we show that the number of nondeterministic moves of a finite automaton, if limited, is bounded by 2n - 2 where n is the number of states. If the finite automaton is over a one letter alphabet, using Gohon's result the number of nondeterministic moves, if limited, is less than n2. In both cases, we present families of finite automata demonstrating that the upper bounds obtained are almost tight.
引用
收藏
页码：355 / 363
页数：9
相关论文
共 50 条
  • [41] On determinism versus nondeterminism for restarting automata
    Messerschmidt, Hartmut
    Otto, Friedrich
    INFORMATION AND COMPUTATION, 2008, 206 (9-10) : 1204 - 1218
  • [42] MEASURES OF NONDETERMINISM FOR PUSHDOWN-AUTOMATA
    SALOMAA, K
    YU, S
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1994, 49 (02) : 362 - 374
  • [43] THE MEASURES OF NONDETERMINISM FOR PUSHDOWN-AUTOMATA
    NASYROV, IR
    COMPUTERS AND ARTIFICIAL INTELLIGENCE, 1989, 8 (01): : 43 - 52
  • [44] DEGREES OF NONDETERMINISM FOR PUSHDOWN-AUTOMATA
    SALOMAA, K
    YU, S
    LECTURE NOTES IN COMPUTER SCIENCE, 1991, 529 : 380 - 389
  • [45] THE DEGREES OF NONDETERMINISM IN PUSHDOWN-AUTOMATA
    NASYROV, IR
    LECTURE NOTES IN COMPUTER SCIENCE, 1987, 278 : 339 - 342
  • [46] On limited versus polynomial nondeterminism
    Feige, U
    Kilian, J
    CHICAGO JOURNAL OF THEORETICAL COMPUTER SCIENCE, 1997, (01): : 1 - 20
  • [47] The Roles of Advice to One-Tape Linear-Time Turing Machines and Finite Automata (Extended Abstract)
    Yamakami, Tomoyuki
    ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2009, 5878 : 933 - 942
  • [48] State Complexity and Limited Nondeterminism
    Palioudakis, Alexandros
    Salomaa, Kai
    Akl, Selim G.
    DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS, DCFS 2012, 2012, 7386 : 252 - 265
  • [49] Real-counter automata and their decision problems (extended abstract)
    Dang, Zhe
    Ibarra, Oscar H.
    San Pietro, Pierluigi
    Xie, Gaoyan
    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2004, 3328 : 198 - 210
  • [50] Classifying Words with 3-sort Automata: an extended abstract
    Jastrzab, Tomasz
    Lardeux, Frederic
    Monfroy, Eric
    39TH ANNUAL ACM SYMPOSIUM ON APPLIED COMPUTING, SAC 2024, 2024, : 787 - 788
12345