net.automatalib.util.automata.fsa.MutableDFAs Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of automata-util Show documentation

This artifact provides various common utility operations for analyzing and manipulating automata and graphs, such as traversal, minimization and copying.

There is a newer version: 0.11.0

Show newest version

/* Copyright (C) 2013-2019 TU Dortmund
 * This file is part of AutomataLib, http://www.automatalib.net/.
 *
 * 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 net.automatalib.util.automata.fsa;

import java.util.Collection;

import net.automatalib.automata.fsa.MutableDFA;
import net.automatalib.util.automata.Automata;

public final class MutableDFAs {

    private MutableDFAs() {
        throw new IllegalStateException("Constructor should never be invoked");
    }

    public static  void complete(MutableDFA dfa, Collection inputs) {
        complete(dfa, inputs, false);
    }

    public static  void complete(MutableDFA dfa, Collection inputs, boolean minimize) {
        complete(dfa, inputs, minimize, false);
    }

    public static  void complete(MutableDFA dfa,
                                       Collection inputs,
                                       boolean minimize,
                                       boolean undefinedAcceptance) {
        S sink = null;

        for (S state : dfa) {
            for (I input : inputs) {
                S succ = dfa.getSuccessor(state, input);
                if (succ == null) {
                    if (sink == null) {
                        sink = dfa.addState(undefinedAcceptance);
                        for (I inputSym : inputs) {
                            dfa.addTransition(sink, inputSym, sink);
                        }
                    }
                    dfa.addTransition(state, input, sink);
                }
            }
        }

        if (minimize) {
            Automata.invasiveMinimize(dfa, inputs);
        }
    }

    public static  void complement(MutableDFA dfa, Collection inputs) {
        dfa.flipAcceptance();
        complete(dfa, inputs, false, true);
    }
}