Guttman, OmriVishwanathan, SWilliamson, Robert2015-12-13October 8-354029242Xhttp://hdl.handle.net/1885/82367Efficient learnability using the state merging algorithm is known for a subclass of probabilistic automata termed μ-distinguishable. In this paper, we prove that state merging algorithms can be extended to efficiently learn a larger class of automata. InKeywords: Algorithms; Learning systems; Probabilistic logics; Theorem proving; Learnability; Oracles; State merging algorithms; Automata theory200510.1007/11564089_152015-12-11