Package owl.automaton.acceptance
Class OmegaAcceptance
- java.lang.Object
-
- owl.automaton.acceptance.OmegaAcceptance
-
- Direct Known Subclasses:
AllAcceptance
,EmersonLeiAcceptance
,GeneralizedBuchiAcceptance
,GeneralizedCoBuchiAcceptance
,GeneralizedRabinAcceptance
,ParityAcceptance
public abstract class OmegaAcceptance extends Object
-
-
Constructor Summary
Constructors Constructor Description OmegaAcceptance()
-
Method Summary
All Methods Instance Methods Abstract Methods Concrete Methods Modifier and Type Method Description abstract int
acceptanceSets()
abstract Optional<BitSet>
acceptingSet()
Returns a set of indices which repeated infinitely often are accepting orOptional.empty()
if no such set exists.abstract jhoafparser.ast.BooleanExpression<jhoafparser.ast.AtomAcceptance>
booleanExpression()
Get the canonical representation asBooleanExpression
.boolean
isAccepting(BitSet set)
Returns whether repeating these acceptance indices infinitely often would be accepting.boolean
isAcceptingEdge(Edge<?> edge)
Returns whether repeating this edge infinitely often would be accepting.<S> boolean
isWellFormedAutomaton(Automaton<S,?> automaton)
boolean
isWellFormedEdge(Edge<?> edge)
This method determines if the given edge is a well defined edge for this acceptance condition.abstract String
name()
List<Object>
nameExtra()
abstract Optional<BitSet>
rejectingSet()
Returns a set of indices which repeated infinitely often are rejecting orOptional.empty()
if no such set exists.String
toString()
-
-
-
Method Detail
-
acceptanceSets
public abstract int acceptanceSets()
-
booleanExpression
public abstract jhoafparser.ast.BooleanExpression<jhoafparser.ast.AtomAcceptance> booleanExpression()
Get the canonical representation asBooleanExpression
.
-
name
@Nullable public abstract String name()
-
acceptingSet
public abstract Optional<BitSet> acceptingSet()
Returns a set of indices which repeated infinitely often are accepting orOptional.empty()
if no such set exists.- See Also:
isAccepting(BitSet)
-
rejectingSet
public abstract Optional<BitSet> rejectingSet()
Returns a set of indices which repeated infinitely often are rejecting orOptional.empty()
if no such set exists.- See Also:
isAccepting(BitSet)
-
isAccepting
public boolean isAccepting(BitSet set)
Returns whether repeating these acceptance indices infinitely often would be accepting.
-
isAcceptingEdge
public boolean isAcceptingEdge(Edge<?> edge)
Returns whether repeating this edge infinitely often would be accepting.
-
isWellFormedEdge
public boolean isWellFormedEdge(Edge<?> edge)
This method determines if the given edge is a well defined edge for this acceptance condition. E.g. a parity condition might check that the edge has at most one acceptance index and the index is less than the colour count.- Parameters:
edge
- The edge to be checked.- Returns:
- Whether the edge acceptance is well defined.
-
isWellFormedAutomaton
public <S> boolean isWellFormedAutomaton(Automaton<S,?> automaton)
-
-