nondeterministic finite automaton
C50072
concept
A nondeterministic finite automaton is a theoretical computational model consisting of a finite set of states and transitions where, for a given state and input symbol, the machine may move to zero, one, or multiple possible next states (including via ε-moves), accepting an input string if at least one possible path leads to an accepting state.
All labels observed (1)
| Label | Occurrences |
|---|---|
| nondeterministic finite automaton canonical | 1 |
Description generation (CDg)
The one-sentence description above was generated by prompting gpt-5.1 with the class name and this instruction.
Instruction
generate a one-sentence description for a given conceptual class. # Response Format Return only the sentence: "Description: [one-sentence description of the conceptional class]"
Input
Class: nondeterministic finite automaton
Generated description
A nondeterministic finite automaton is a theoretical computational model consisting of a finite set of states and transitions where, for a given state and input symbol, the machine may move to zero, one, or multiple possible next states (including via ε-moves), accepting an input string if at least one possible path leads to an accepting state.
Instances (1)
| Instance | Via concept surface |
|---|---|
| NFA | — |