I
- the input typepublic class DFALassoImpl<I> extends AbstractLasso<I,Boolean> implements Lasso.DFALasso<I>
DFA
s.Lasso.DFALasso<I>, Lasso.MealyLasso<I,O>
UniversalDeterministicAutomaton.FullIntAbstraction<T,SP,TP>, UniversalDeterministicAutomaton.IntAbstraction<T,SP,TP>, UniversalDeterministicAutomaton.StateIntAbstraction<I,T,SP,TP>
FiniteStateAcceptor.FSAGraphView<S,I,A extends FiniteStateAcceptor<S,I>>
NO_LASSO
STATE_PROPERTIES, TRANSITION_PROPERTIES
Constructor and Description |
---|
DFALassoImpl(DetOutputAutomaton<?,I,?,Boolean> automaton,
Collection<? extends I> inputs,
int unfoldTimes) |
Modifier and Type | Method and Description |
---|---|
boolean |
isAccepting(Integer state)
Returns whether the given state is accepting.
|
getAutomaton, getInitialState, getInputAlphabet, getLoop, getLoopBeginIndices, getOutput, getPrefix, getStates, getSuccessor, getTransition, getUnfolds, getWord
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
getAutomaton, getLoop, getLoopBeginIndices, getOutput, getPrefix, getUnfolds, getWord
getInputAlphabet
accepts, computeOutput, computeStateOutput, computeSuffixOutput, isAccepting
fullIntAbstraction, fullIntAbstraction, stateIntAbstraction
getTransitionProperty
getSuccessor, getSuccessors, getTransition, getTransitions, transToSet
getInitialState, getInitialStates, getState, getStates, getSuccessor, getSuccessors, stateToSet
transitionGraphView
getStateProperty, getSuccessor, getTransitionProperty
powersetView
createStaticStateMapping, getStates, iterator, size, stateIDs
createDynamicStateMapping, getSuccessors
forEach, spliterator
public DFALassoImpl(DetOutputAutomaton<?,I,?,Boolean> automaton, Collection<? extends I> inputs, int unfoldTimes)
public boolean isAccepting(Integer state)
The current state is only accepting iff it is precisely the state after the last symbol index in the finite representation of the lasso.
isAccepting
in interface AcceptorTS<Integer,I>
state
- to compute whether it is accepting.state
is accepting.Copyright © 2019. All rights reserved.