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. © Springer-Verlag Berlin Heidelberg 2004.
Cite
CITATION STYLE
Cano, A., Ruiz, J., & García, P. (2004). Running FCRPNI in efficient time for Piecewise and Right Piecewise Testable Languages. In Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) (Vol. 3264, pp. 275–276). Springer Verlag. https://doi.org/10.1007/978-3-540-30195-0_25
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
