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
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
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)
Cohen, J., Perrin, D., Pin, J.-E.: On the expressive power of temporal logic. Jounal of Computer and System Sciences.271–294 (1993)
Simon, I.: Piecewise testable events. In: Brakhage, H. (ed.) GI-Fachtagung 1975. LNCS, vol. 33, pp. 214–222. Springer, Heidelberg (1975)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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