java.lang.Object
- owl.automaton.acceptance.EmersonLeiAcceptance

Direct Known Subclasses:

GeneralizedBuchiAcceptance, GeneralizedCoBuchiAcceptance, GeneralizedRabinAcceptance, ParityAcceptance
```
public class EmersonLeiAcceptance
extends Object
```

Method Summary

All Methods Static Methods Instance Methods Concrete Methods
Modifier and Type	Method	Description
`int`	`acceptanceSets()`
`Optional<ImmutableBitSet>`	`acceptingSet()`	Returns a set of indices which repeated infinitely often are accepting or `Optional.empty()` if no such set exists.
`PropositionalFormula<Integer>`	`booleanExpression()`	Get the canonical representation as `PropositionalFormula`.
`boolean`	`equals(Object o)`
`int`	`hashCode()`
`boolean`	`isAccepting(BitSet set)`	Returns whether repeating these acceptance indices infinitely often would be accepting.
`boolean`	`isAccepting(Set<Integer> set)`
`boolean`	`isAcceptingEdge(Edge<?> edge)`	Returns whether repeating this edge infinitely often would be accepting.
`<S> boolean`	`isWellFormedAutomaton(Automaton<S,?> automaton)`
`protected PropositionalFormula<Integer>`	`lazyBooleanExpression()`
`String`	`name()`
`List<Object>`	`nameExtra()`
`static EmersonLeiAcceptance`	`of(PropositionalFormula<Integer> expression)`	Find heuristically the weakest acceptance condition for the given expression and construct it.
`Optional<ImmutableBitSet>`	`rejectingSet()`	Returns a set of indices which repeated infinitely often are rejecting or `Optional.empty()` if no such set exists.
`String`	`toString()`

Methods inherited from class java.lang.Object
clone, finalize, getClass, notify, notifyAll, wait, wait, wait

- Method Detail
  - of
```
public static EmersonLeiAcceptance of(PropositionalFormula<Integer> expression)
```
    Find heuristically the weakest acceptance condition for the given expression and construct it. Only simple syntactic checks on the boolean expression of the acceptance conditions are performed. For advanced (and complete) techniques use the typeness implementations.
    
    Returns:
    
    the acceptance condition.
  - acceptanceSets
```
public final int acceptanceSets()
```
  - booleanExpression
```
public final PropositionalFormula<Integer> booleanExpression()
```
    Get the canonical representation as PropositionalFormula.
  - lazyBooleanExpression
```
@Nullable
protected PropositionalFormula<Integer> lazyBooleanExpression()
```
  - name
```
@Nullable
public String name()
```
  - nameExtra
```
public List<Object> nameExtra()
```
  - acceptingSet
```
public Optional<ImmutableBitSet> acceptingSet()
```
    Returns a set of indices which repeated infinitely often are accepting or Optional.empty() if no such set exists.
    
    See Also:
    
    isAccepting(BitSet)
  - rejectingSet
```
public Optional<ImmutableBitSet> rejectingSet()
```
    Returns a set of indices which repeated infinitely often are rejecting or Optional.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.
  - isAccepting
```
public boolean isAccepting(Set<Integer> set)
```
  - isAcceptingEdge
```
public boolean isAcceptingEdge(Edge<?> edge)
```
    Returns whether repeating this edge infinitely often would be accepting.
  - isWellFormedAutomaton
```
public <S> boolean isWellFormedAutomaton(Automaton<S,?> automaton)
```
  - equals
```
public boolean equals(Object o)
```
    Overrides:
    
    equals in class Object
  - hashCode
```
public int hashCode()
```
    Overrides:
    
    hashCode in class Object
  - toString
```
public final String toString()
```
    Overrides:
    
    toString in class Object

Class EmersonLeiAcceptance

Method Summary

Methods inherited from class java.lang.Object

Method Detail

of

acceptanceSets

booleanExpression

lazyBooleanExpression

name

nameExtra

acceptingSet

rejectingSet

isAccepting

isAccepting

isAcceptingEdge

isWellFormedAutomaton

equals

hashCode

toString