Skip to main content
Springer Nature Link
Log in

A Comparative Study of Two Algorithms for Automata Identification

  • Conference paper
Grammatical Inference: Algorithms and Applications (ICGI 2000)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1891))

Included in the following conference series:

  • 375 Accesses

Abstract

We describe in this paper the experiments done to compare two algorithms that identify the family of regular languages in the limit, the algorithm of Trakhenbrot and Barzdin/Gold by one hand and the RPNI/Lang algorithm by the other. As a previous step, for a better comparison, we formulate the algorithm of Gold as a merging states in the prefix tree acceptor scheme.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. García, P., Cano, A., Ruiz, J.: Estudio comparativo de dos algoritmos de identificaci ón de autómatas. Internal Report DSIC-II/1/00 Univ. Politécnica Valencia (2000) (In Spanish)

    Google Scholar 

  2. Gold, M.: Complexity of Automaton Identification from Given Data. Information and Control 37, 302–320 (1978)

    Article  MATH  MathSciNet  Google Scholar 

  3. Hopcroft, J., Ullman, J.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading (1979)

    MATH  Google Scholar 

  4. Lang, K.J.: Random DFA’s can be Approximately Learned from Sparse Uniform Examples. In: Proceedings of the Fifth Annual ACM Workshop on Computational Learning Theory, pp. 45–52 (1992)

    Google Scholar 

  5. Oncina, J., García, P.: Inferring Regular Languages in Polynomial Updated Time. In: de la Blanca, P., Sanfeliú, V. (eds.) Pattern Recognition and Image Analysys. World Scientific, Singapore (1992)

    Google Scholar 

  6. Trakhtenbrot, B., Ya, B.: Finite Automata: Behavior and Synthesis. North Holland Publishing Company, Amsterdam (1973)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Depto. de Sistemas Informáticos y Computación, Universidad Politécnica de Valencia, Valencia, Spain

    P. García, A. Cano & J. Ruiz

Authors
  1. P. García
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. Cano
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. J. Ruiz
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. INESC-ID/IST, R. Alves Redol 9, 1000, Lisboa, Portugal

    Arlindo L. Oliveira

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

García, P., Cano, A., Ruiz, J. (2000). A Comparative Study of Two Algorithms for Automata Identification. In: Oliveira, A.L. (eds) Grammatical Inference: Algorithms and Applications. ICGI 2000. Lecture Notes in Computer Science(), vol 1891. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45257-7_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-45257-7_10

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41011-9

  • Online ISBN: 978-3-540-45257-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics