- All Implemented Interfaces:
Iterable<State>,Automaton<State,,Character, State> Automaton.RegularAutomaton<State,,Character, State> FiniteRepresentation,InitialStates<State>,Output<Character,,Boolean> OutputAutomaton<State,,Character, State, Boolean> SuffixOutput<Character,,Boolean> FiniteStateAcceptor<State,,Character> NFA<State,,Character> SimpleAutomaton<State,,Character> UniversalAutomaton<State,,Character, State, Boolean, Void> UniversalAutomaton.RegularAutomaton<State,,Character, State, Boolean, Void> GraphViewable,FiniteSemantics,Semantics,AcceptorTS<State,,Character> OutputTS<State,,Character, State, Boolean> SimpleTS<State,,Character> TransitionSystem<State,,Character, State> UniversalTransitionSystem<State,Character, State, Boolean, Void>
NFA.
This adapter is backed by the Brics automaton, so changes to the Automaton are reflected.
As a DFA can be regarded as a special case of an NFA, using this class on a Brics Automaton will always work.
However, determining successor states for input characters might be much less efficient than when using a BricsDFA.
-
Nested Class Summary
Nested classes/interfaces inherited from class net.automatalib.brics.AbstractBricsAutomaton
AbstractBricsAutomaton.GraphViewNested classes/interfaces inherited from interface net.automatalib.automaton.Automaton
Automaton.RegularAutomaton<S,I, T> Nested classes/interfaces inherited from interface net.automatalib.automaton.fsa.FiniteStateAcceptor
FiniteStateAcceptor.FSAGraphView<S,I, A extends FiniteStateAcceptor<S, I>> Nested classes/interfaces inherited from interface net.automatalib.automaton.UniversalAutomaton
UniversalAutomaton.RegularAutomaton<S,I, T, SP, TP> -
Field Summary
Fields inherited from class net.automatalib.brics.AbstractBricsAutomaton
automatonFields inherited from interface net.automatalib.automaton.fsa.FiniteStateAcceptor
STATE_PROPERTIES, TRANSITION_PROPERTIES -
Constructor Summary
Constructors -
Method Summary
Methods inherited from class net.automatalib.brics.AbstractBricsAutomaton
getBricsAutomaton, getInitialStates, getStates, getTransitions, graphView, isAcceptingMethods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, waitMethods inherited from interface net.automatalib.ts.acceptor.AcceptorTS
accepts, computeOutput, computeSuffixOutput, getStateProperty, getSuccessor, getTransitionProperty, isAccepting, powersetViewMethods inherited from interface net.automatalib.automaton.fsa.FiniteStateAcceptor
getSemantics, transitionGraphViewMethods inherited from interface net.automatalib.automaton.concept.InitialStates
getInitialStatesMethods inherited from interface java.lang.Iterable
forEach, spliteratorMethods inherited from interface net.automatalib.automaton.fsa.NFA
isAcceptingMethods inherited from interface net.automatalib.automaton.simple.SimpleAutomaton
createDynamicStateMapping, createStaticStateMapping, getStates, iterator, size, stateIDsMethods inherited from interface net.automatalib.ts.simple.SimpleTS
getStates, getSuccessorsMethods inherited from interface net.automatalib.ts.TransitionSystem
getSuccessors, getTransitions
-
Constructor Details
-
BricsNFA
Constructor.Note: Brics automata may only be partially defined (especially when created from regular expressions). If you plan to use this wrapper in any structural analysis (e.g. for determining equivalence), consider using
BricsNFA(Automaton, boolean)instead.- Parameters:
automaton- the Brics automaton to wrap.
-
BricsNFA
Constructor.If the parameter
totalizeis set totrue, an additional sink state will be added to the automaton and all otherwise undefined transitions will transition the automaton into the sink. Note: this mutates the originalautomaton.- Parameters:
automaton- the Brics automaton to wrap.totalize- flag, indicating whether the automaton should have a total transition function.
-