001/* Copyright (C) 2013 TU Dortmund
002 * This file is part of LearnLib, http://www.learnlib.de/.
003 * 
004 * LearnLib is free software; you can redistribute it and/or
005 * modify it under the terms of the GNU Lesser General Public
006 * License version 3.0 as published by the Free Software Foundation.
007 * 
008 * LearnLib is distributed in the hope that it will be useful,
009 * but WITHOUT ANY WARRANTY; without even the implied warranty of
010 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
011 * Lesser General Public License for more details.
012 * 
013 * You should have received a copy of the GNU Lesser General Public
014 * License along with LearnLib; if not, see
015 * <http://www.gnu.de/documents/lgpl.en.html>.
016 */
017package de.learnlib.algorithms.lstargeneric.dfa;
018
019import net.automatalib.words.Word;
020
021import java.util.ArrayList;
022import java.util.List;
023
024public class LStarDFAUtil {
025        
026        public static <I> List<Word<I>> ensureSuffixCompliancy(List<Word<I>> suffixes) {
027                List<Word<I>> compSuffixes = new ArrayList<Word<I>>();
028                compSuffixes.add(Word.<I>epsilon());
029                for(Word<I> suff : suffixes) {
030                        if(!suff.isEmpty())
031                                compSuffixes.add(suff);
032                }
033                
034                return compSuffixes;
035        }
036}