Interface FiniteRepresentation
-
- All Known Subinterfaces:
AcceptanceGraph<N,E>
,ADSNode<S,I,O>
,Automaton<S,I,T>
,BidirectionalGraph<N,E>
,BidirectionalGraph.IntAbstraction<E>
,ContextFreeModalProcessSystem<L,AP>
,DeterministicAutomaton<S,I,T>
,DeterministicAutomaton.FullIntAbstraction<T>
,DeterministicAutomaton.IntAbstraction<T>
,DeterministicAutomaton.StateIntAbstraction<I,T>
,DetOutputAutomaton<S,I,T,D>
,DetSuffixOutputAutomaton<S,I,T,D>
,DFA<S,I>
,FiniteAlphabetAutomaton<S,I,T>
,FiniteKripkeStructure<N,E,AP>
,FiniteKTS<S,I,T,AP>
,FiniteLabeledGraph<N,E,L>
,FiniteStateAcceptor<S,I>
,Graph<N,E>
,Graph.IntAbstraction<E>
,Lasso<I,D>
,Lasso.DFALasso<I>
,Lasso.MealyLasso<I,O>
,MealyMachine<S,I,T,O>
,ModalTransitionSystem<S,I,T,TP>
,MooreMachine<S,I,T,O>
,MutableAutomaton<S,I,T,SP,TP>
,MutableDeterministic<S,I,T,SP,TP>
,MutableDeterministic.FullIntAbstraction<T,SP,TP>
,MutableDeterministic.IntAbstraction<T,SP,TP>
,MutableDeterministic.StateIntAbstraction<I,T,SP,TP>
,MutableDFA<S,I>
,MutableFSA<S,I>
,MutableGraph<N,E,NP,EP>
,MutableGraph.IntAbstraction<E,NP,EP>
,MutableMealyMachine<S,I,T,O>
,MutableModalTransitionSystem<S,I,T,TP>
,MutableMooreMachine<S,I,T,O>
,MutableNFA<S,I>
,MutableProbabilisticMealy<S,I,T,O>
,MutableProceduralModalProcessGraph<N,L,E,AP,TP>
,MutableSubsequentialTransducer<S,I,T,O>
,MutableUniversalBidirectionalGraph<N,E,NP,EP>
,NFA<S,I>
,OneSEVPA<L,I>
,OutputAutomaton<S,I,T,D>
,ProbabilisticMealyMachine<S,I,T,O>
,ProceduralModalProcessGraph<N,L,E,AP,TP>
,net.automatalib.automaton.procedural.ProceduralSystem<I,M>
,RecursiveADSNode<S,I,O,N>
,SBA<S,I>
,SEVPA<L,I>
,ShrinkableAutomaton<S,I,T,SP,TP>
,ShrinkableDeterministic<S,I,T,SP,TP>
,ShrinkableGraph<N,E>
,SimpleAutomaton<S,I>
,SimpleDeterministicAutomaton<S,I>
,SimpleDeterministicAutomaton.FullIntAbstraction
,SimpleDeterministicAutomaton.IntAbstraction
,SimpleDeterministicAutomaton.StateIntAbstraction<I>
,SimpleGraph<N>
,SimpleGraph.IntAbstraction
,SPA<S,I>
,SPMM<S,I,T,O>
,StateLocalInputMealyMachine<S,I,T,O>
,StateOutputAutomaton<S,I,T,O>
,SubsequentialTransducer<S,I,T,O>
,TransitionOutputAutomaton<S,I,T,O>
,UndirectedGraph<N,E>
,UniversalAutomaton<S,I,T,SP,TP>
,UniversalBidirectionalGraph<N,E,NP,EP>
,UniversalDeterministicAutomaton<S,I,T,SP,TP>
,UniversalDeterministicAutomaton.FullIntAbstraction<T,SP,TP>
,UniversalDeterministicAutomaton.IntAbstraction<T,SP,TP>
,UniversalDeterministicAutomaton.StateIntAbstraction<I,T,SP,TP>
,UniversalFiniteAlphabetAutomaton<S,I,T,SP,TP>
,UniversalGraph<N,E,NP,EP>
,UniversalGraph.IntAbstraction<E,NP,EP>
- All Known Implementing Classes:
AbstractAutomatonGraphView
,AutomatonGraphView
,CFMPSGraphView
,DeterministicAbstractions.FullIntAbstraction
,DeterministicAbstractions.StateIntAbstraction
,FiniteStateAcceptor.FSAGraphView
,MealyMachine.MealyGraphView
,ModalTransitionSystem.MTSGraphView
,MooreMachine.MooreGraphView
,MutableDeterministicAbstraction.FullIntAbstraction
,MutableDeterministicAbstraction.StateIntAbstraction
,ProceduralGraphView
,SEVPAGraphView
,SimpleDeterministicAbstractions.FullIntAbstraction
,SimpleDeterministicAbstractions.IntAbstraction
,SimpleDeterministicAbstractions.StateIntAbstraction
,SubsequentialTransducer.SSTGraphView
,UniversalAutomatonGraphView
,UniversalDeterministicAbstractions.FullIntAbstraction
,UniversalDeterministicAbstractions.StateIntAbstraction
public interface FiniteRepresentation
This interface marks automata types that have a finite representation, i.e. can be represented by a finite number of entities. Note that this does not necessarily correspond to states in the usual sense (like in the case ofSimpleAutomaton
). For example, push-down systems can have infinitely many states but may be representable with a finite amount of locations.
-
-
Method Summary
All Methods Instance Methods Abstract Methods Modifier and Type Method Description int
size()
Returns the number of entities required to represent this system.
-