共 50 条
- [27] On the Complexity of the Equivalence Problem for Probabilistic Automata FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATIONAL STRUCTURES, FOSSACS 2012, 2012, 7213 : 467 - 481
- [30] Equivalence of Deterministic and Nondeterministic Epsilon Automata FORMALIZED MATHEMATICS, 2009, 17 (02): : 193 - 199