Method | Description | |
---|---|---|
AddEpsilons ( Fare.Automaton a, ICollection |
Adds epsilon transitions to the given automaton. This method adds extra character interval transitions that are equivalent to the given set of epsilon transitions.
|
|
Complement ( Fare.Automaton a ) : Fare.Automaton |
Returns a (deterministic) automaton that accepts the complement of the language of the given automaton. Complexity: linear in number of states (if already deterministic). |
|
Concatenate ( Fare.Automaton a1, Fare.Automaton a2 ) : Fare.Automaton | ||
Concatenate ( IList |
||
Determinize ( Fare.Automaton a ) : void |
Determinizes the specified automaton. Complexity: exponential in number of states. |
|
Determinize ( Fare.Automaton a, List |
Determinizes the given automaton using the given set of initial states.
|
|
Intersection ( Fare.Automaton a1, Fare.Automaton a2 ) : Fare.Automaton |
Returns an automaton that accepts the intersection of the languages of the given automata. Never modifies the input automata languages.
|
|
IsEmpty ( Fare.Automaton a ) : bool |
Determines whether the given automaton accepts no strings.
|
|
IsEmptyString ( Fare.Automaton a ) : bool |
Determines whether the given automaton accepts the empty string and nothing else.
|
|
Optional ( Fare.Automaton a ) : Fare.Automaton |
Returns an automaton that accepts the union of the empty string and the language of the given automaton. Complexity: linear in number of states. |
|
Repeat ( Fare.Automaton a ) : Fare.Automaton |
Accepts the Kleene star (zero or more concatenated repetitions) of the language of the given automaton. Never modifies the input automaton language. Complexity: linear in number of states. |
|
Repeat ( Fare.Automaton a, int min ) : Fare.Automaton |
Accepts Complexity: linear in number of states and in |
|
Repeat ( Fare.Automaton a, int min, int max ) : Fare.Automaton |
Accepts between Complexity: linear in number of states and in |
|
Run ( Fare.Automaton a, string s ) : bool |
Returns true if the given string is accepted by the automaton. Complexity: linear in the length of the string. For full performance, use the RunAutomaton class. |
|
Union ( IList |
Returns an automaton that accepts the union of the languages of the given automata. Complexity: linear in number of states. |
public static AddEpsilons ( Fare.Automaton a, ICollection |
||
a | Fare.Automaton | The automaton. |
pairs | ICollection |
A collection of |
return | void |
public static Complement ( Fare.Automaton a ) : Fare.Automaton | ||
a | Fare.Automaton | The automaton. |
return | Fare.Automaton |
public static Concatenate ( Fare.Automaton a1, Fare.Automaton a2 ) : Fare.Automaton | ||
a1 | Fare.Automaton | |
a2 | Fare.Automaton | |
return | Fare.Automaton |
public static Concatenate ( IList |
||
l | IList |
|
return | Fare.Automaton |
public static Determinize ( Fare.Automaton a ) : void | ||
a | Fare.Automaton | The automaton. |
return | void |
public static Determinize ( Fare.Automaton a, List |
||
a | Fare.Automaton | The automaton. |
initialset | List |
The initial states. |
return | void |
public static Intersection ( Fare.Automaton a1, Fare.Automaton a2 ) : Fare.Automaton | ||
a1 | Fare.Automaton | The a1. |
a2 | Fare.Automaton | The a2. |
return | Fare.Automaton |
public static IsEmpty ( Fare.Automaton a ) : bool | ||
a | Fare.Automaton | The automaton. |
return | bool |
public static IsEmptyString ( Fare.Automaton a ) : bool | ||
a | Fare.Automaton | The automaton. |
return | bool |
public static Optional ( Fare.Automaton a ) : Fare.Automaton | ||
a | Fare.Automaton | The automaton. |
return | Fare.Automaton |
public static Repeat ( Fare.Automaton a ) : Fare.Automaton | ||
a | Fare.Automaton | The automaton. |
return | Fare.Automaton |
public static Repeat ( Fare.Automaton a, int min ) : Fare.Automaton | ||
a | Fare.Automaton | The automaton. |
min | int | The minimum concatenated repetitions of the language of the given /// automaton. |
return | Fare.Automaton |
public static Repeat ( Fare.Automaton a, int min, int max ) : Fare.Automaton | ||
a | Fare.Automaton | The automaton. |
min | int | The minimum concatenated repetitions of the language of the given /// automaton. |
max | int | The maximum concatenated repetitions of the language of the given /// automaton. |
return | Fare.Automaton |
public static Run ( Fare.Automaton a, string s ) : bool | ||
a | Fare.Automaton | The automaton. |
s | string | The string. |
return | bool |
public static Union ( IList |
||
automatons | IList |
The l. |
return | Fare.Automaton |