FiniteStateAcceptor (AutomataLib 0.12.0 API)

All Superinterfaces:

AcceptorTS<S,I>, Automaton<S,I,S>, FiniteRepresentation, Iterable<S>, Output<I,Boolean>, OutputAutomaton<S,I,S,Boolean>, SimpleAutomaton<S,I>, SimpleTS<S,I>, SuffixOutput<I,Boolean>, TransitionSystem<S,I,S>, UniversalAutomaton<S,I,S,Boolean,Void>, UniversalTransitionSystem<S,I,S,Boolean,Void>

All Known Subinterfaces:

DFA<S,I>, Lasso.DFALasso<I>, MutableDFA<S,I>, MutableFSA<S,I>, MutableNFA<S,I>, NFA<S,I>

All Known Implementing Classes:

AbstractBricsAutomaton, BricsDFA, BricsNFA, CompactDFA, CompactNFA, DFALassoImpl, FastDFA, FastNFA
```
public interface FiniteStateAcceptor<S,I>
extends AcceptorTS<S,I>, UniversalAutomaton<S,I,S,Boolean,Void>, OutputAutomaton<S,I,S,Boolean>, SuffixOutput<I,Boolean>
```
FiniteStateAcceptors accept regular languages.

Nested Class Summary

Nested Classes
Modifier and Type Interface Description

static class FiniteStateAcceptor.FSAGraphView<S,I,A extends FiniteStateAcceptor<S,I>>

Field Summary

Fields
Modifier and Type Field Description

static List<Boolean> STATE_PROPERTIES

static List<Void> TRANSITION_PROPERTIES

Method Summary

All Methods Instance Methods Default Methods
Modifier and Type	Method	Description
`default Boolean`	`computeOutput(Iterable<? extends I> input)`
`default Boolean`	`computeSuffixOutput(Iterable<? extends I> prefix, Iterable<? extends I> suffix)`
`default UniversalGraph<S,TransitionEdge<I,S>,Boolean,TransitionEdge.Property<I,Void>>`	`transitionGraphView(Collection<? extends I> inputs)`	Obtains a `graph` view of the transition graph of this automaton, taking into account the specified input symbols.

Methods inherited from interface net.automatalib.ts.acceptor.AcceptorTS
accepts, getStateProperty, getSuccessor, getTransitionProperty, isAccepting, isAccepting, powersetView

Methods inherited from interface java.lang.Iterable
forEach, spliterator

Methods inherited from interface net.automatalib.automaton.simple.SimpleAutomaton
createDynamicStateMapping, createStaticStateMapping, getStates, iterator, size, stateIDs

Methods inherited from interface net.automatalib.ts.simple.SimpleTS
getInitialStates, getStates, getSuccessors

Methods inherited from interface net.automatalib.ts.TransitionSystem
getSuccessors, getTransitions

- Field Detail
  - STATE_PROPERTIES
```
static final List<Boolean> STATE_PROPERTIES
```
  - TRANSITION_PROPERTIES
```
static final List<Void> TRANSITION_PROPERTIES
```
- Method Detail
  - computeSuffixOutput
```
default Boolean computeSuffixOutput(Iterable<? extends I> prefix,
                                    Iterable<? extends I> suffix)
```
    Specified by:
    
    computeSuffixOutput in interface SuffixOutput<S,I>
  - computeOutput
```
default Boolean computeOutput(Iterable<? extends I> input)
```
    Specified by:
    
    computeOutput in interface Output<S,I>
    
    Specified by:
    
    computeOutput in interface SuffixOutput<S,I>
  - transitionGraphView
```
default UniversalGraph<S,TransitionEdge<I,S>,Boolean,TransitionEdge.Property<I,Void>> transitionGraphView(Collection<? extends I> inputs)
```
    Description copied from interface: Automaton
    
    Obtains a graph view of the transition graph of this automaton, taking into account the specified input symbols. The transitions are represented as TransitionEdges in the graph.
    
    Specified by:
    
    transitionGraphView in interface Automaton<S,I,S>
    
    Specified by:
    
    transitionGraphView in interface UniversalAutomaton<S,I,S,Boolean,Void>
    
    Parameters:
    
    inputs - the input symbols to consider
    
    Returns:
    
    a graph view of the transition graph of this automaton for the given input symbols