共 50 条
- [1] THE EQUIVALENCE AND LEARNING OF PROBABILISTIC-AUTOMATA 30TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, 1989, : 268 - 273
- [5] COMPARATIVE COMPLEXITY OF THE REPRESENTATION OF LANGUAGES BY PROBABILISTIC-AUTOMATA CYBERNETICS, 1989, 25 (03): : 311 - 316
- [7] THE INCREASE IN THE NUMBER OF STATES IN DETERMINIZATION OF FINITE PROBABILISTIC-AUTOMATA AVTOMATIKA I VYCHISLITELNAYA TEKHNIKA, 1982, (03): : 39 - 42
- [9] APPLICATION OF GROWING PROBABILISTIC-AUTOMATA FOR MATHEMATICAL-MODELING CYBERNETICS, 1989, 25 (01): : 111 - 114