Namespace Automata.Core

An alphabet associated with a finite state automaton.

Class representing automata related constants.

Asserts conditions and throws exceptions.

Static class for conversion between different types of finite state automata.

Deterministic finite automaton (DFA).

Provides a reverse lookup for a DFA.

Specifically:

- Get the set of states that can transition to a given state with a given symbol.

- Get the set of symbols that can transition to a given state.

Common base class for all Finite state automata.

Common base class for deterministic automata, such as Dfa and Mfa.

Immutable set of integers.

Minimal Finite-state Automaton (MFA).

Nondeterministic finite automaton (NFA).

An epsilon transition in an automaton, defined by a starting state and an ending state.

A fast readonly view of a state in a deterministic automaton, providing access to transitions from this specific state.

Represents a (symbolic) transition in an automaton, defined by a starting state, a symbol, and an ending state.

Search Results for