Interface SubsequentialTransducer<S,I,T,O>
-
- Type Parameters:
S
- state typeI
- input symbol typeT
- transition typeO
- output symbol type
- All Superinterfaces:
Automaton<S,I,T>
,DeterministicAutomaton<S,I,T>
,DeterministicOutputTS<S,I,T,O>
,DeterministicTransitionSystem<S,I,T>
,DetOutputAutomaton<S,I,T,Word<O>>
,DetSuffixOutputAutomaton<S,I,T,Word<O>>
,FiniteRepresentation
,Iterable<S>
,Output<I,Word<O>>
,OutputAutomaton<S,I,T,Word<O>>
,SimpleAutomaton<S,I>
,SimpleDeterministicAutomaton<S,I>
,SimpleDTS<S,I>
,SimpleTS<S,I>
,SuffixOutput<I,Word<O>>
,TransitionSystem<S,I,T>
,UniversalAutomaton<S,I,T,Word<O>,Word<O>>
,UniversalDeterministicAutomaton<S,I,T,Word<O>,Word<O>>
,UniversalDTS<S,I,T,Word<O>,Word<O>>
,UniversalTransitionSystem<S,I,T,Word<O>,Word<O>>
- All Known Subinterfaces:
MutableSubsequentialTransducer<S,I,T,O>
- All Known Implementing Classes:
CompactSST
public interface SubsequentialTransducer<S,I,T,O> extends DeterministicOutputTS<S,I,T,O>, DetSuffixOutputAutomaton<S,I,T,Word<O>>, UniversalDeterministicAutomaton<S,I,T,Word<O>,Word<O>>
A subsequential transducer (or SST) is anDeterministicOutputTS
whose state and transition properties are output-words
. Upon parsing a sequence of input symbols, each transition emits asequence
of output symbols. After all inputs have been parsed, the output of the reached state will be emitted as well.Implementation detail: There exist definitions of SSTs that associate each state with an additional notion of 'acceptance' in order to reject certain transductions. This implementation/interface denotes prefix-closed transductions, i.e. all states are accepting. If you would like to filter out certain transduction you may use a supplementary
DFA
for this decision problem.
-
-
Nested Class Summary
Nested Classes Modifier and Type Interface Description static class
SubsequentialTransducer.SSTGraphView<S,I,T,O,A extends SubsequentialTransducer<S,I,T,O>>
-
Nested classes/interfaces inherited from interface net.automatalib.automaton.DeterministicAutomaton
DeterministicAutomaton.FullIntAbstraction<T>, DeterministicAutomaton.IntAbstraction<T>, DeterministicAutomaton.StateIntAbstraction<I,T>
-
Nested classes/interfaces inherited from interface net.automatalib.automaton.UniversalDeterministicAutomaton
UniversalDeterministicAutomaton.FullIntAbstraction<T,SP,TP>, UniversalDeterministicAutomaton.IntAbstraction<T,SP,TP>, UniversalDeterministicAutomaton.StateIntAbstraction<I,T,SP,TP>
-
-
Method Summary
All Methods Instance Methods Default Methods Modifier and Type Method Description default Word<O>
computeStateOutput(S state, Iterable<? extends I> input)
default boolean
trace(S state, Iterable<? extends I> input, List<? super O> output)
default UniversalGraph<S,TransitionEdge<I,T>,Word<O>,TransitionEdge.Property<I,Word<O>>>
transitionGraphView(Collection<? extends I> inputs)
Obtains agraph
view of the transition graph of this automaton, taking into account the specified input symbols.-
Methods inherited from interface net.automatalib.ts.output.DeterministicOutputTS
trace
-
Methods inherited from interface net.automatalib.ts.DeterministicTransitionSystem
getSuccessor, getSuccessors, getTransition, getTransitions
-
Methods inherited from interface net.automatalib.automaton.concept.DetSuffixOutputAutomaton
computeOutput, computeSuffixOutput
-
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.SimpleDTS
getInitialState, getInitialStates, getState, getStates, getSuccessor, getSuccessors, getSuccessors
-
Methods inherited from interface net.automatalib.ts.simple.SimpleTS
getSuccessors
-
Methods inherited from interface net.automatalib.ts.TransitionSystem
getSuccessor, powersetView
-
Methods inherited from interface net.automatalib.automaton.UniversalDeterministicAutomaton
fullIntAbstraction, fullIntAbstraction, stateIntAbstraction
-
Methods inherited from interface net.automatalib.ts.UniversalDTS
getTransitionProperty
-
Methods inherited from interface net.automatalib.ts.UniversalTransitionSystem
getStateProperty, getTransitionProperty
-
-
-
-
Method Detail
-
computeStateOutput
default Word<O> computeStateOutput(S state, Iterable<? extends I> input)
- Specified by:
computeStateOutput
in interfaceDetSuffixOutputAutomaton<S,I,T,O>
-
transitionGraphView
default UniversalGraph<S,TransitionEdge<I,T>,Word<O>,TransitionEdge.Property<I,Word<O>>> transitionGraphView(Collection<? extends I> inputs)
Description copied from interface:Automaton
Obtains agraph
view of the transition graph of this automaton, taking into account the specified input symbols. The transitions are represented asTransitionEdge
s in the graph.- Specified by:
transitionGraphView
in interfaceAutomaton<S,I,T>
- Specified by:
transitionGraphView
in interfaceUniversalAutomaton<S,I,T,Word<O>,Word<O>>
- Parameters:
inputs
- the input symbols to consider- Returns:
- a graph view of the transition graph of this automaton for the given input symbols
-
-