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

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.