Skip to main content
SpringerLink
Log in

Residual Languages and Probabilistic Automata

  • Conference paper
  • First Online:
Book cover Automata, Languages and Programming (ICALP 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2719))

Included in the following conference series:

  • 1952 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Rabiner, L.R.: A tutorial on hidden Markov models and selected applications in speech recognition. Proceedings of the IEEE 77 (1989) 257–285

    Article  Google Scholar 

  2. Jelinek, F.: Statistical Methods for Speech Recognition. The MIT Press, Cambridge, Massachusetts (1997)

    Google Scholar 

  3. Freitag, D., McCallum, A.: Information extraction with HMM structures learned by stochastic optimization. In: AAAI/IAAI. (2000) 584–589

    Google Scholar 

  4. Baldi, P., Brunak, S.: Bioinformatics: The Machine Learning Approach. MIT Press (1998)

    Google Scholar 

  5. Durbin, R., Eddy, S., Krogh, A., Mitchison, G.: Biological Sequence Analysis: Probabilistic Models of Proteins and Nucleic Acids. CUP (1998)

    Google Scholar 

  6. Casacuberta, F.: Some relations among stochastic finite state networks used in automatic speech recognition. IEEE Transactions on Pattern Analysis and Machine Intelligence PAMI-12 (1990) 691–695

    Article  Google Scholar 

  7. Carrasco, R., Oncina, J.: Learning stochastic regular grammars by means of a state merging method. In: International Conference on Grammatical Inference, Heidelberg, Springer-Verlag (1994) 139–152

    Google Scholar 

  8. Carrasco, R.C., Oncina, J.: Learning deterministic regular grammars from stochastic samples in p olynomial time. RAIRO (Theoretical Informatics and Applications) 33 (1999) 1–20

    Article  MATH  MathSciNet  Google Scholar 

  9. Thollard, F., Dupont, P., de la Higuera, C.: Probabilistic DFA inference using Kullback-Leibler divergence and minimality. In: Proc. 17th International Conf. on Machine Learning, (KAUFM) 975–982

    Google Scholar 

  10. Higuera, C.D.L., Thollard, F.: Identification in the limit with probability one of stochastic deterministic finite automata. In: Grammatical Inference: Algorithms and Applications, 5th International Colloquium, ICGI 2000, Lisbon, Portugal, September 11–13, 2000; Proceedings. Volume 1891 of Lecture Notes in Artificial Intelligence., Springer (2000) 141–156

    Google Scholar 

  11. Denis, F., Lemay, A., Terlutte, A.: Learning regular languages using RFSA. In Springer-Verlag, ed.: Proceedings of the 12th International Conference on Algorithmic Learning Theory (ALT-01). Number 2225 in Lecture Notes in Computer Science (2001) 348–359

    Chapter  Google Scholar 

  12. Denis, F., Lemay, A., Terlutte, A.: Learning regular languages using non deterministic finite automata. In: ICGI’2000, 5th International Colloquium on Grammatical Inference. Volume 1891 of LNAI., Springer Verlag (2000) 39–50

    Google Scholar 

  13. Esposito, Y., Lemay, A., Denis, F., Dupont, P.: Learning probabilistic residual finite state automata. In: ICGI’2002, 6th International Colloquium on Grammatical Inference. LNAI, Springer Verlag (2002)

    Google Scholar 

  14. Denis, F., Lemay, A., Terlutte, A.: Residual Finite State Automata. Fundamenta Informaticae 51 (2002) 339–368

    MATH  MathSciNet  Google Scholar 

  15. Balasubramanian, V.: Equivalence and reduction of hidden markov models. Technical Report AITR-1370, MIT (1993)

    Google Scholar 

  16. Paz, A.: Introduction to probabilistic automata. Academic Press, London (1971)

    MATH  Google Scholar 

  17. Mohri, M.: Finite-state transducers in language and speech processing. Computational Linguistics 23 (1997) 269–311

    MathSciNet  Google Scholar 

  18. Allauzen, C., Mohri, M.: Efficient algorithms for testing the twins property. Journal of Automata, Languages and Combinatorics (to appear, 2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. UMR 6166, LIF-CMI, 39, rue F. Joliot Curie, 13453, Marseille Cedex 13, France

    François Denis & Yann Esposito

Authors
  1. François Denis
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yann Esposito
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. of Mathematics and Computer Science, Technische Universiteit Eindhoven, P.O. Box 513, 5600 MB, Eindhoven, The Netherlands

    Jos C. M. Baeten

  2. School of Industrial and Systems Engineering, Georgia Institute of Technology, 765 Ferst Drive, Atlanta, GA, 30332-0205, USA

    Jan Karel Lenstra

  3. Department of Information Technology, Uppsala University, P.O. Box 337, 75105, Uppsala, Sweden

    Joachim Parrow

  4. Faculty of Electrical Engineering, Mathematics and Computer Science, University of Twente, P.O. Box 217, 7500 AE, Enschede, The Netherlands

    Gerhard J. Woeginger

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Denis, F., Esposito, Y. (2003). Residual Languages and Probabilistic Automata. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds) Automata, Languages and Programming. ICALP 2003. Lecture Notes in Computer Science, vol 2719. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45061-0_37

Download citation

  • DOI: https://doi.org/10.1007/3-540-45061-0_37

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40493-4

  • Online ISBN: 978-3-540-45061-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation