LANGUAGES REPRESENTABLE BY FINITE PROBABILISTIC AUTOMATA

被引：3
|
作者：
DIEU, PD
机构：
来源：
ZEITSCHRIFT FUR MATHEMATISCHE LOGIK UND GRUNDLAGEN DER MATHEMATIK | 1971年 / 17卷 / 05期
关键词：
D O I：
10.1002/malq.19710170147
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
引用
收藏
页码：427 / &
相关论文
共 50 条
  • [41] 2 ω-finite automata and sets of obstructions of their languages
    B. F. Melnikov
    Korean Journal of Computational & Applied Mathematics, 1999, 6 (3) : 565 - 574
  • [42] The complexity of probabilistic versus deterministic finite automata
    Ambainis, A
    ALGORITHMS AND COMPUTATION, 1996, 1178 : 233 - 238
  • [43] PROBABILISTIC EXAMINATION OF TRANSITION PROCESS IN FINITE AUTOMATA
    LEVIN, VI
    ENGINEERING CYBERNETICS, 1976, 14 (01): : 74 - 84
  • [44] The complexity of probabilistic versus quantum finite automata
    Midrijanis, G
    SOFSEM 2002: THEORY AND PRACTICE OF INFORMATICS, 2002, 2540 : 273 - 278
  • [45] Learning probabilistic residual finite state automata
    Esposito, Y
    Lemay, A
    Denis, F
    Dupont, P
    GRAMMATICAL INFERENCE: ALGORITHMS AND APPLIICATIONS, 2002, 2484 : 77 - 91
  • [46] Algebraic properties of probabilistic finite state automata
    Xie, Zhengwei
    Zhai, Ying
    Deng, Peimin
    Yi, Zhong
    Jisuanji Yanjiu yu Fazhan/Computer Research and Development, 2013, 50 (12): : 2691 - 2698
  • [47] FUZZY EVENTS REALIZED BY FINITE PROBABILISTIC AUTOMATA
    NASU, M
    HONDA, N
    INFORMATION AND CONTROL, 1968, 12 (04): : 284 - &
  • [48] Approximating Probabilistic Models as Weighted Finite Automata
    Suresh, Ananda Theertha
    Roark, Brian
    Riley, Michael
    Schogol, Vlad
    COMPUTATIONAL LINGUISTICS, 2021, 47 (02) : 221 - 254
  • [49] On the learnability and usage of acyclic probabilistic finite automata
    Ron, D
    Singer, Y
    Tishby, N
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1998, 56 (02) : 133 - 152
  • [50] REALIZATIONS OF FUZZY LANGUAGES BY PROBABILISTIC, MAX PRODUCT, AND MAXIMIN AUTOMATA
    SANTOS, ES
    INFORMATION SCIENCES, 1975, 8 (01) : 39 - 53
12345