net.automatalib.ts.acceptors

Interface AcceptorTS<S,I>

Type Parameters:

S - state class

I - input symbol class

All Superinterfaces:

SimpleTS<S,I>, TransitionSystem<S,I,S>, UniversalTransitionSystem<S,I,S,Boolean,Void>

All Known Subinterfaces:

DeterministicAcceptorTS<S,I>, DFA<S,I>, FiniteStateAcceptor<S,I>, MutableDFA<S,I>, MutableFSA<S,I>, MutableNFA<S,I>, NFA<S,I>

All Known Implementing Classes:

AbstractAcceptorTS, AbstractBricsAutomaton, AbstractDeterministicAcceptorTS, AbstractDFA, AbstractFSA, AbstractMutableDFA, AbstractMutableFSA, AbstractMutableNFA, AbstractNFA, BricsDFA, BricsNFA, CompactDFA, DetAcceptorComposition, FastDFA, FastNFA

public interface AcceptorTS<S,I>
extends UniversalTransitionSystem<S,I,S,Boolean,Void>

A transition system whose semantics are defined by whether a state is "accepting" or not.

Author:

Malte Isberner

Method Summary

Modifier and Type	Method and Description
boolean	accepts(Iterable<I> input) Determines whether the given input word is accepted by this acceptor.
boolean	isAccepting(S state) Checks whether the given state is accepting.

Methods inherited from interface net.automatalib.ts.UniversalTransitionSystem

getStateProperty, getTransitionProperty

Methods inherited from interface net.automatalib.ts.TransitionSystem

getSuccessor, getTransitions, powersetView

Methods inherited from interface net.automatalib.ts.simple.SimpleTS

createDynamicStateMapping, createStaticStateMapping, getInitialStates, getStates, getSuccessors, getSuccessors, getSuccessors

Method Detail

isAccepting

boolean isAccepting(S state)

Checks whether the given state is accepting.

Parameters:

state - the state

Returns:

true if the state is accepting, false otherwise.

accepts

boolean accepts(Iterable<I> input)

Determines whether the given input word is accepted by this acceptor.

Parameters:

input - the input word.

Returns:

true if the input word is accepted, false otherwise.