Package owl.automaton
Enum Automaton.Property
- java.lang.Object
-
- java.lang.Enum<Automaton.Property>
-
- owl.automaton.Automaton.Property
-
- All Implemented Interfaces:
Serializable
,Comparable<Automaton.Property>
- Enclosing interface:
- Automaton<S,A extends EmersonLeiAcceptance>
public static enum Automaton.Property extends Enum<Automaton.Property>
-
-
Enum Constant Summary
Enum Constants Enum Constant Description COMPLETE
An automaton is complete if there is at least one initial state and every state has at least one successor for each letter of the alphabet.DETERMINISTIC
An automaton is deterministic if there is at most one initial state and every state has at most one successor for each letter of the alphabet.LIMIT_DETERMINISTIC
An automaton is limit-deterministic if it is has (generalised) Büchi acceptance condition and every state reachable from an edge with an acceptance marking is deterministic.SEMI_DETERMINISTIC
An automaton is semi-deterministic if every state has at most one successor for each letter of the alphabet.
-
Method Summary
All Methods Static Methods Concrete Methods Modifier and Type Method Description static Automaton.Property
valueOf(String name)
Returns the enum constant of this type with the specified name.static Automaton.Property[]
values()
Returns an array containing the constants of this enum type, in the order they are declared.
-
-
-
Enum Constant Detail
-
COMPLETE
public static final Automaton.Property COMPLETE
An automaton is complete if there is at least one initial state and every state has at least one successor for each letter of the alphabet.
-
DETERMINISTIC
public static final Automaton.Property DETERMINISTIC
An automaton is deterministic if there is at most one initial state and every state has at most one successor for each letter of the alphabet.
-
SEMI_DETERMINISTIC
public static final Automaton.Property SEMI_DETERMINISTIC
An automaton is semi-deterministic if every state has at most one successor for each letter of the alphabet.
-
LIMIT_DETERMINISTIC
public static final Automaton.Property LIMIT_DETERMINISTIC
An automaton is limit-deterministic if it is has (generalised) Büchi acceptance condition and every state reachable from an edge with an acceptance marking is deterministic. Thus all accepting runs are eventually trapped within a subset of the states that have deterministic transition relation.
-
-
Method Detail
-
values
public static Automaton.Property[] values()
Returns an array containing the constants of this enum type, in the order they are declared. This method may be used to iterate over the constants as follows:for (Automaton.Property c : Automaton.Property.values()) System.out.println(c);
- Returns:
- an array containing the constants of this enum type, in the order they are declared
-
valueOf
public static Automaton.Property valueOf(String name)
Returns the enum constant of this type with the specified name. The string must match exactly an identifier used to declare an enum constant in this type. (Extraneous whitespace characters are not permitted.)- Parameters:
name
- the name of the enum constant to be returned.- Returns:
- the enum constant with the specified name
- Throws:
IllegalArgumentException
- if this enum type has no constant with the specified nameNullPointerException
- if the argument is null
-
-