Class BasicOperations

Basic automata operations.

@lucene.experimental

Inheritance
System.Object
BasicOperations
Assembly: DistributedLucene.Net.dll
Syntax
public static class BasicOperations : object

Methods

Name Description
AddEpsilons(Automaton, ICollection<StatePair>)

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(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(IList<Automaton>)

Returns an automaton that accepts the concatenation of the languages of the given automata.

Complexity: linear in total number of states.
Concatenate(Automaton, Automaton)

Returns an automaton that accepts the concatenation of the languages of the given automata.

Complexity: linear in number of states.
Determinize(Automaton)

Determinizes the given automaton.

Worst case complexity: exponential in number of states.
Intersection(Automaton, Automaton)

Returns an automaton that accepts the intersection of the languages of the given automata. Never modifies the input automata languages.

Complexity: quadratic in number of states.
IsEmpty(Automaton)

Returns true if the given automaton accepts no strings.
IsEmptyString(Automaton)

Returns true if the given automaton accepts the empty string and nothing else.
IsTotal(Automaton)

Returns true if the given automaton accepts all strings.
Minus(Automaton, Automaton)

Returns a (deterministic) automaton that accepts the intersection of the language of a1 and the complement of the language of a2. As a side-effect, the automata may be determinized, if not already deterministic.

Complexity: quadratic in number of states (if already deterministic).
Optional(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(Automaton)

Returns an automaton that 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(Automaton, Int32)

Returns an automaton that accepts min or more concatenated repetitions of the language of the given automaton.

Complexity: linear in number of states and in min.
Repeat(Automaton, Int32, Int32)

Returns an automaton that accepts between min and max (including both) concatenated repetitions of the language of the given automaton.

Complexity: linear in number of states and in min and max.
Run(Automaton, String)

Returns true if the given string is accepted by the automaton.

Complexity: linear in the length of the string.

Note: for full performance, use the RunAutomaton class.
SameLanguage(Automaton, Automaton)

Returns true if these two automata accept exactly the same language. This is a costly computation! Note also that a1 and a2 will be determinized as a side effect.
SubsetOf(Automaton, Automaton)

Returns true if the language of a1 is a subset of the language of a2. As a side-effect, a2 is determinized if not already marked as deterministic.

Complexity: quadratic in number of states.
Union(ICollection<Automaton>)

Returns an automaton that accepts the union of the languages of the given automata.

Complexity: linear in number of states.
Union(Automaton, Automaton)

Returns an automaton that accepts the union of the languages of the given automata.

Complexity: linear in number of states.