共 50 条
- [2] THE EQUIVALENCE AND LEARNING OF PROBABILISTIC-AUTOMATA 30TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, 1989, : 268 - 273
- [4] On the determinization of weighted finite automata AUTOMATA, LANGUAGES AND PROGRAMMING, 1998, 1443 : 482 - 493
- [8] COMPARATIVE COMPLEXITY OF THE REPRESENTATION OF LANGUAGES BY PROBABILISTIC-AUTOMATA CYBERNETICS, 1989, 25 (03): : 311 - 316
- [9] 2-WAY FINITE PROBABILISTIC-AUTOMATA AND TAPE-BOUNDED TURING-MACHINES DOKLADY AKADEMII NAUK SSSR, 1981, 256 (06): : 1326 - 1329