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 条
  • [21] Size of quantum versus deterministic finite automata
    Ambainis, A
    Barbans, U
    Belousova, A
    Belovs, A
    Dzelme, I
    Folkmanis, G
    Freivalds, R
    Ledins, P
    Opmanis, R
    Skuskovniks, A
    VLSI'03: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON VLSI, 2003, : 303 - 308
  • [22] PAC-learnability of Probabilistic Deterministic Finite State Automata
    Clark, A
    Thollard, F
    JOURNAL OF MACHINE LEARNING RESEARCH, 2004, 5 : 473 - 497
  • [23] Note on the succinctness of deterministic, nondeterministic, probabilistic and quantum finite automata
    Mereghetti, C
    Palano, B
    Pighizzini, G
    RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS, 2001, 35 (05): : 477 - 490
  • [24] Adaptively learning probabilistic deterministic automata from data streams
    Balle, Borja
    Castro, Jorge
    Gavalda, Ricard
    MACHINE LEARNING, 2014, 96 (1-2) : 99 - 127
  • [25] Learning deterministic probabilistic automata from a model checking perspective
    Mao, Hua
    Chen, Yingke
    Jaeger, Manfred
    Nielsen, Thomas D.
    Larsen, Kim G.
    Nielsen, Brian
    MACHINE LEARNING, 2016, 105 (02) : 255 - 299
  • [26] Adaptively learning probabilistic deterministic automata from data streams
    Borja Balle
    Jorge Castro
    Ricard Gavaldà
    Machine Learning, 2014, 96 : 99 - 127
  • [27] Learning deterministic probabilistic automata from a model checking perspective
    Hua Mao
    Yingke Chen
    Manfred Jaeger
    Thomas D. Nielsen
    Kim G. Larsen
    Brian Nielsen
    Machine Learning, 2016, 105 : 255 - 299
  • [28] State complexity of deterministic Watson–Crick automata and time varying Watson–Crick automata
    Kumar Sankar Ray
    Kingshuk Chatterjee
    Debayan Ganguly
    Natural Computing, 2015, 14 : 691 - 699
  • [29] COMPARATIVE COMPLEXITY OF THE REPRESENTATION OF LANGUAGES BY PROBABILISTIC-AUTOMATA
    ABLAEV, FM
    CYBERNETICS, 1989, 25 (03): : 311 - 316
  • [30] On the complexity of membership and counting in height-deterministic pushdown automata
    Limaye, Nutan
    Mahajan, Meena
    Meyer, Antoine
    COMPUTER SCIENCE - THEORY AND APPLICATIONS, 2008, 5010 : 240 - +
12345