cppformlang::finite_automata::NondeterministicFiniteAutomaton class
#include <cppformlang/finite_automata/nondeterministic_finite_automaton.h>

Represents a general finite automaton.

Base classes

template<typename Transitions> class FiniteAutomaton<NondeterministicTransitions>: Represents a general finite automaton.

static auto FromRegex(const std::string& regex) -> NondeterministicFiniteAutomaton

void Union(const FiniteAutomaton& other): Makes the union of this and other object.
void Concatenate(const FiniteAutomaton& other): Makes the concatenation of this and other object.
void KleeneStar(): Makes the kleene star of the current object.
auto Accepts(const Symbol* begin, const Symbol* end) const -> bool: Checks whether the nfa accepts a given word.
auto Eclose(State state) const -> std::unordered_set<State>: Compute the epsilon closure of of state.
auto IsDeterministic() const -> bool
auto ToDeterministic() const -> NondeterministicFiniteAutomaton
auto Minimize() const -> NondeterministicFiniteAutomaton

Checks whether the nfa accepts a given word.

Parameters
begin in	Begin of the word(source symbols)
end in	End of the word(source symbols)
Returns	Whether the word is accepted or not

Compute the epsilon closure of of state.

Parameters
state in	The source state
Returns	The epsilon closure of the source state