Residual Languages and Probabilistic Automata

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.

[1]  Aurélien Lemay,et al.  Learning regular languages using RFSAs , 2004, Theor. Comput. Sci..

[2]  Lawrence R. Rabiner,et al.  A tutorial on hidden Markov models and selected applications in speech recognition , 1989, Proc. IEEE.

[3]  José Oncina,et al.  Learning deterministic regular grammars from stochastic samples in polynomial time , 1999, RAIRO Theor. Informatics Appl..

[4]  Aurélien Lemay,et al.  Learning Regular Languages Using Non Deterministic Finite Automata , 2000, ICGI.

[5]  Andrew McCallum,et al.  Information Extraction with HMM Structures Learned by Stochastic Optimization , 2000, AAAI/IAAI.

[6]  Francisco Casacuberta Some Relations Among Stochastic Finite State Networks Used in Automatic Speech Recognition , 1990, IEEE Trans. Pattern Anal. Mach. Intell..

[7]  Sean R. Eddy,et al.  Biological Sequence Analysis: Probabilistic Models of Proteins and Nucleic Acids , 1998 .

[8]  José Oncina,et al.  Learning Stochastic Regular Grammars by Means of a State Merging Method , 1994, ICGI.

[9]  Cyril Allauzen,et al.  Efficient Algorithms for Testing the Twins Property , 2003, J. Autom. Lang. Comb..

[10]  Colin de la Higuera,et al.  Identification in the Limit with Probability One of Stochastic Deterministic Finite Automata , 2000, ICGI.

[11]  Frederick Jelinek,et al.  Statistical methods for speech recognition , 1997 .

[12]  V. Balasubramanian Equivalence and Reduction of Hidden Markov Models , 1993 .

[13]  Aurélien Lemay,et al.  Residual Finite State Automata , 2002, Fundam. Informaticae.

[14]  Colin de la Higuera,et al.  Probabilistic DFA Inference using Kullback-Leibler Divergence and Minimality , 2000, ICML.

[15]  Azaria Paz,et al.  Introduction to Probabilistic Automata , 1971 .

[16]  Mehryar Mohri,et al.  Finite-State Transducers in Language and Speech Processing , 1997, CL.

[17]  Pierre Dupont,et al.  Learning Probabilistic Residual Finite State Automata , 2002, ICGI.

[18]  Azaria Paz,et al.  Introduction to probabilistic automata (Computer science and applied mathematics) , 1971 .

[19]  Pierre Baldi,et al.  Bioinformatics - the machine learning approach (2. ed.) , 2000 .