![JAR search and dependency download from the Maven repository](/logo.png)
de.learnlib.algorithms.rpni.BlueFringeRPNIDFA Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of learnlib-rpni Show documentation
Show all versions of learnlib-rpni Show documentation
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.
More details on the blue-fringe version of this algorithm can be found in the book "Grammatical Inference"
(https://doi.org/10.1017/CBO9781139194655) by Colin de la Higuera.
/* Copyright (C) 2013-2018 TU Dortmund
* This file is part of LearnLib, http://www.learnlib.de/.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package de.learnlib.algorithms.rpni;
import java.util.ArrayList;
import java.util.Collection;
import java.util.List;
import de.learnlib.api.algorithm.PassiveLearningAlgorithm;
import de.learnlib.api.query.DefaultQuery;
import de.learnlib.datastructure.pta.pta.BlueFringePTA;
import net.automatalib.automata.fsa.DFA;
import net.automatalib.automata.fsa.impl.compact.CompactDFA;
import net.automatalib.words.Alphabet;
/**
* A Blue Fringe version of RPNI for learning DFAs.
*
* @param
* input symbol type
*
* @author Malte Isberner
*/
public class BlueFringeRPNIDFA extends AbstractBlueFringeRPNI>
implements PassiveLearningAlgorithm.PassiveDFALearner {
protected final List positive = new ArrayList<>();
protected final List negative = new ArrayList<>();
/**
* Constructor.
*
* @param alphabet
* the alphabet
*/
public BlueFringeRPNIDFA(Alphabet alphabet) {
super(alphabet);
}
@Override
public void addSamples(Collection extends DefaultQuery> samples) {
for (DefaultQuery query : samples) {
int[] arr = query.getInput().toIntArray(alphabet);
if (query.getOutput()) {
positive.add(arr);
} else {
negative.add(arr);
}
}
}
@Override
protected void initializePTA(BlueFringePTA pta) {
for (int[] sample : positive) {
pta.addSample(sample, true);
}
for (int[] sample : negative) {
pta.addSample(sample, false);
}
}
@Override
protected CompactDFA ptaToModel(BlueFringePTA pta) {
CompactDFA dfa = new CompactDFA<>(alphabet, pta.getNumRedStates());
pta.toAutomaton(dfa, alphabet, b -> b, x -> x);
return dfa;
}
}
© 2015 - 2025 Weber Informatics LLC | Privacy Policy