Artifacts using LearnLib :: Datastructures :: PTA (4)

Sort by:Popular▼

✓Popular✓Newest

This artifact provides the implementation of (a blue-fringe version of) the "regular positive negative inference" (RPNI) learning algorithm as presented in the paper "Inferring regular languages in polynomial update time" (https://doi.org/10.1142/9789812797902_0004) by Jose Oncina and Pedro García, including merging heuristics such as the "evidence-driven state merging" (EDSM) and "minimum description length" (MDL) strategies. More details on these implementations can be ...

An artifact that aggregates all other artifacts of LearnLib to produce an Uber-JAR that can be used in non-maven environments. Likewise, this single artifact may be used in maven-aware environments to declare a dependency on all LearnLib artifacts.

This artifact provides the implementation of (a blue-fringe version of) the "regular positive negative inference" (RPNI) learning algorithm as presented in the paper "Inferring regular languages in polynomial update time" (https://dx.doi.org/10.1142/9789812797902_0004) by Jose Oncina and Pedro García using the "evidence-driven state merging" (EDSM) heuristic. More details on this algorithm can be found in the book "Grammatical Inference" ...

This artifact provides the implementation of (a blue-fringe version of) the "regular positive negative inference" (RPNI) learning algorithm as presented in the paper "Inferring regular languages in polynomial update time" (https://dx.doi.org/10.1142/9789812797902_0004) by Jose Oncina and Pedro García using the "minimum description length" (MDL) heuristic. More details on this algorithm can be found in the book "Grammatical Inference" ...