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 条

[1] REPRESENTABILITY OF NONREGULAR LANGUAGES IN FINITE PROBABILISTIC AUTOMATA
KNAST, R
INFORMATION AND CONTROL, 1970, 16 (03): : 285 - &
[2] Decision Problems for Probabilistic Finite Automata on Bounded Languages
Bell, Paul C.
Halava, Vesa
Hirvensalo, Mika
FUNDAMENTA INFORMATICAE, 2013, 123 (01) : 1 - 14
[3] CONCISE REPRESENTATIONS OF REGULAR LANGUAGES BY DEGREE AND PROBABILISTIC FINITE AUTOMATA
KINTALA, CMR
PUN, KY
WOTSCHKE, D
MATHEMATICAL SYSTEMS THEORY, 1993, 26 (04): : 379 - 395
[4] Quantum Finite Automata and Probabilistic Reversible Automata: R-trivial Idempotent Languages
Golovkins, Marats
Kravtsev, Maksim
Kravcevs, Vasilijs
MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2011, 2011, 6907 : 351 - 363
[5] RECOGNITION OF LANGUAGES BY FINITE MULTI-HEAD PROBABILISTIC AND DETERMINISTIC AUTOMATA
FREIVALDS, RV
AVTOMATIKA I VYCHISLITELNAYA TEKHNIKA, 1979, (03): : 15 - 20
[6] Residual languages and probabilistic automata
Denis, F
Esposito, Y
AUTOMATA, LANGUAGES AND PROGRAMMING, PROCEEDINGS, 2003, 2719 : 452 - 463
[7] ONE SUFFICIENT CRITERION OF NON-REPRESENTABILITY OF LANGUAGES IN FINITE PROBABILISTIC AUTOMATA
ALPIN, YA
BUKHARAEV, RG
DOKLADY AKADEMII NAUK SSSR, 1975, 223 (04): : 777 - 780
[8] PROJECTIONS OF LANGUAGES RECOGNIZABLE BY PROBABILISTIC AND ALTERNATING FINITE MULTI-TAPE AUTOMATA
FREIVALDS, R
INFORMATION PROCESSING LETTERS, 1981, 13 (4-5) : 195 - 198
[9] Recognizing ω-regular languages with probabilistic automata
Baier, C
Grösser, M
LICS 2005: 20TH ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE - PROCEEDINGS, 2005, : 137 - 146
[10] ON LANGUAGES DEFINED BY LINEAR PROBABILISTIC AUTOMATA
GELENBE, SE
INFORMATION AND CONTROL, 1970, 16 (05): : 487 - +

← 1 2 3 4 5 →