COMPLEXITY OF PROBABILISTIC VERSUS DETERMINISTIC AUTOMATA

被引：0
|
作者：
FREIVALDS, R
机构：
来源：
LECTURE NOTES IN COMPUTER SCIENCE | 1991年 / 502卷
关键词：
D O I：
暂无
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
引用
收藏
页码：565 / 613
页数：49
相关论文
共 50 条
  • [1] The complexity of probabilistic versus deterministic finite automata
    Ambainis, A
    ALGORITHMS AND COMPUTATION, 1996, 1178 : 233 - 238
  • [2] ON COMPARING PROBABILISTIC AND DETERMINISTIC AUTOMATA COMPLEXITY OF LANGUAGES
    ABLAYEV, FM
    LECTURE NOTES IN COMPUTER SCIENCE, 1989, 379 : 599 - 605
  • [3] The complexity of probabilistic versus quantum finite automata
    Midrijanis, G
    SOFSEM 2002: THEORY AND PRACTICE OF INFORMATICS, 2002, 2540 : 273 - 278
  • [4] SEQUENTIAL DECOMPOSITION OF A PROBABILISTIC AUTOMATON INTO A PROBABILISTIC AND DETERMINISTIC AUTOMATA
    KURMIT, AA
    AVTOMATIKA I VYCHISLITELNAYA TEKHNIKA, 1983, (01): : 49 - 49
  • [5] Astrobiological Complexity with Probabilistic Cellular Automata
    Vukotic, Branislav
    Cirkovic, Milan M.
    ORIGINS OF LIFE AND EVOLUTION OF BIOSPHERES, 2012, 42 (04): : 347 - 371
  • [6] On the Complexity of the Equivalence Problem for Probabilistic Automata
    Kiefer, Stefan
    Murawski, Andrzej S.
    Ouaknine, Joel
    Wachter, Bjoern
    Worrell, James
    FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATIONAL STRUCTURES, FOSSACS 2012, 2012, 7213 : 467 - 481
  • [7] Stability and Complexity of Minimising Probabilistic Automata
    Kiefer, Stefan
    Wachter, Bjoern
    AUTOMATA, LANGUAGES, AND PROGRAMMING (ICALP 2014), PT II, 2014, 8573 : 268 - 279
  • [8] Astrobiological Complexity with Probabilistic Cellular Automata
    Branislav Vukotić
    Milan M. Ćirković
    Origins of Life and Evolution of Biospheres, 2012, 42 : 347 - 371
  • [9] On the complexity of minimizing probabilistic and quantum automata
    Mateus, Paulo
    Qiu, Daowen
    Li, Lvzhou
    INFORMATION AND COMPUTATION, 2012, 218 : 36 - 53
  • [10] On the Descriptional Complexity of Deterministic Ordered Restarting Automata
    Otto, Friedrich
    DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS, DCFS 2014, 2014, 8614 : 318 - 329
12345