In this paper we extend the PAC learning algorithm due to Clark and Thollard for learning distributions generated by PDFA to
automata whose transitions may take varying time lengths, governed by exponential distributions.
CitationB. Balle; Castro, J.; Gavaldà, R. Learning PDFA with asynchronous transitions. A: International Colloquim on Grammatical Inference. "10th International Colloquim on Grammatical Inference". València: Springer, 2010, p. 271-275.
All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder. If you wish to make any use of the work not provided for in the law, please contact: email@example.com