Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

Running FCRPNI in Efficient Time for Piecewise and Right Piecewise Testable Languages

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

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

Included in the following conference series:

  • 368 Accesses

Abstract

The scheme of the inference algorithm known as FCRPNI is applied to the inference of Piecewise Testable Languages and Right Piecewise Testable Languages. We propose efficient algorithms to decide where an automaton contains the forbidden patterns corresponding to those varieties of languages. We also present the results of the experiments done to compare the performance of the FCRPNI and RPNI algorithms for those varieties.

Work partially supported by Ministerio de Ciencia y Tecnología under project TIC2003-09319-C03-02.

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

Similar content being viewed by others

References

  1. Cano, A., Ruíz, J., García, P.: Inferring subclasses of regular languages faster using RPNI and forbidden configurations. In: Adriaans, P.W., Fernau, H., van Zaanen, M. (eds.) ICGI 2002. LNCS (LNAI), vol. 2484, pp. 28–36. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  2. Cohen, J., Perrin, D., Pin, J.-E.: On the expressive power of temporal logic. Jounal of Computer and System Sciences.271–294 (1993)

    Google Scholar 

  3. Simon, I.: Piecewise testable events. In: Brakhage, H. (ed.) GI-Fachtagung 1975. LNCS, vol. 33, pp. 214–222. Springer, Heidelberg (1975)

    Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Antonio Cano, José Ruiz & Pedro García

Authors
  1. Antonio Cano
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. José Ruiz
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Pedro García
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Informatics and Telecommunications, National Centre for Scientific Research “Demokritos”, Athens, Greece

    Georgios Paliouras

  2. Department of Biosciences and Informatics, Keio University, 3-14-1 Hiyoshi, Kohoku-ku, 223-8522, Yokohama, Japan

    Yasubumi Sakakibara

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cano, A., Ruiz, J., García, P. (2004). Running FCRPNI in Efficient Time for Piecewise and Right Piecewise Testable Languages. In: Paliouras, G., Sakakibara, Y. (eds) Grammatical Inference: Algorithms and Applications. ICGI 2004. Lecture Notes in Computer Science(), vol 3264. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30195-0_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30195-0_25

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation