net.automatalib.automata.fsa.FiniteStateAcceptor.java Source code

Introduction

Here is the source code for net.automatalib.automata.fsa.FiniteStateAcceptor.java

Source

/* 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.automata.fsa;

import java.util.Arrays;
import java.util.Collection;
import java.util.Collections;
import java.util.List;

import com.google.common.collect.Iterables;
import net.automatalib.automata.UniversalAutomaton;
import net.automatalib.automata.concepts.OutputAutomaton;
import net.automatalib.automata.concepts.SuffixOutput;
import net.automatalib.automata.graphs.TransitionEdge;
import net.automatalib.automata.graphs.UniversalAutomatonGraphView;
import net.automatalib.automata.visualization.FSAVisualizationHelper;
import net.automatalib.graphs.UniversalGraph;
import net.automatalib.ts.acceptors.AcceptorTS;
import net.automatalib.visualization.VisualizationHelper;

/**
 * <code>FiniteStateAcceptor</code>s accept regular languages.
 */
public interface FiniteStateAcceptor<S, I> extends AcceptorTS<S, I>, UniversalAutomaton<S, I, S, Boolean, Void>,
        OutputAutomaton<S, I, S, Boolean>, SuffixOutput<I, Boolean> {

    List<Boolean> STATE_PROPERTIES = Arrays.asList(Boolean.FALSE, Boolean.TRUE);
    List<Void> TRANSITION_PROPERTIES = Collections.singletonList(null);

    @Override
    default Boolean computeSuffixOutput(Iterable<? extends I> prefix, Iterable<? extends I> suffix) {
        Iterable<I> input = Iterables.concat(prefix, suffix);
        return computeOutput(input);
    }

    @Override
    default Boolean computeOutput(Iterable<? extends I> input) {
        return accepts(input);
    }

    @Override
    default UniversalGraph<S, TransitionEdge<I, S>, Boolean, TransitionEdge.Property<I, Void>> transitionGraphView(
            Collection<? extends I> inputs) {
        return new FSAGraphView<>(this, inputs);
    }

    class FSAGraphView<S, I, A extends FiniteStateAcceptor<S, I>>
            extends UniversalAutomatonGraphView<S, I, S, Boolean, Void, A> {

        public FSAGraphView(A automaton, Collection<? extends I> inputs) {
            super(automaton, inputs);
        }

        @Override
        public VisualizationHelper<S, TransitionEdge<I, S>> getVisualizationHelper() {
            return new FSAVisualizationHelper<>(automaton);
        }
    }
}