de.learnlib.algorithms.lstargeneric.mealy.LStarMealyUtil Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of learnlib-lstar-generic Show documentation

A flexible, optimized version of Dana Angluin's L* algorithm

There is a newer version: 0.12.0

Show newest version

/* Copyright (C) 2013 TU Dortmund
 * This file is part of LearnLib, http://www.learnlib.de/.
 * 
 * LearnLib is free software; you can redistribute it and/or
 * modify it under the terms of the GNU Lesser General Public
 * License version 3.0 as published by the Free Software Foundation.
 * 
 * LearnLib is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
 * Lesser General Public License for more details.
 * 
 * You should have received a copy of the GNU Lesser General Public
 * License along with LearnLib; if not, see
 * .
 */
package de.learnlib.algorithms.lstargeneric.mealy;

import net.automatalib.words.Alphabet;
import net.automatalib.words.Word;

import java.util.ArrayList;
import java.util.List;

public class LStarMealyUtil {
	
	public static  List> ensureSuffixCompliancy(List> suffixes, Alphabet alphabet,
			boolean needsConsistencyCheck) {
		List> compSuffixes = new ArrayList>();
		if(needsConsistencyCheck) {
			for(int i = 0; i < alphabet.size(); i++)
				compSuffixes.add(Word.fromLetter(alphabet.getSymbol(i)));
		}
		
		for(Word w : suffixes) {
			if(w.isEmpty())
				continue;
			if(needsConsistencyCheck && w.length() == 1)
				continue;
			compSuffixes.add(w);
		}
		
		return compSuffixes;
	}

}