Abstract
A stochastic generalisation of residual languages and operations on Probabilistic Finite Automata (PFA) are studied. When these operations are iteratively applied to a subclass of PFA called PRFA, they lead to a unique canonical form (up to an isomorphism) which can be efficiently computed from any equivalent PRFA representation. © Springer-Verlag Berlin Heidelberg 2003.
Cite
CITATION STYLE
APA
Denis, F., & Esposito, Y. (2003). Residual languages and probabilistic automata. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2719, 452–463. https://doi.org/10.1007/3-540-45061-0_37
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free