A deterministic Finite Automaton More...
Inheritance diagram for System.Automata.FiniteAutomaton:
Public Member Functions | |
| FiniteAutomaton (States q, Alphabet a, TransitionFunction d, State q0, AcceptingStates f) | |
| bool | Run (char[] x) |
| Run the machine using the given input. More... | |
| bool | Run (string x) |
| Run the machine using the given input. More... | |
Additional Inherited Members | |
 Properties inherited from System.Automata.Automaton | |
| States | States [get, protected set] |
| The set of states. More... | |
| AcceptingStates | AcceptingStates [get, protected set] |
| The set of accepting states. More... | |
| Alphabet | Alphabet [get, protected set] |
| The machine's alphabet. More... | |
| State | InitialState [get, protected set] |
| The initial state. More... | |
| TransitionFunction | Transitions [get, protected set] |
| The state transition mappings More... | |
Detailed Description
A deterministic Finite Automaton
Member Function Documentation
◆ Run() [1/2]
| bool System.Automata.FiniteAutomaton.Run | ( | char [] | x | ) |
Run the machine using the given input.
- Parameters
-
x The input string.
- Returns
- True if the machine accepts the input string.
◆ Run() [2/2]
| bool System.Automata.FiniteAutomaton.Run | ( | string | x | ) |
Run the machine using the given input.
- Parameters
-
x The input string.
- Returns
- True if the machine accepts the input string.
The documentation for this class was generated from the following file:
- System.Automata/FiniteAutomaton.cs
