nondeterministic finite automaton
Sign in to saveAlso known as NFA
finite-state machine in which the transitions are not necessarily uniquely determined by the state and input
In the Vinony graph
Within Vinony's link graph, nondeterministic finite automaton is referenced by 136 other articles, and connects out to regular language, finite-state machine and alphabet.
It is catalogued under the topic Finite-state machines.
Its subject is documented across 26 Wikipedia language editions.
Wikidata facts
- Subclass of
- finite-state machine
- Image
- Thompson-or.svg
Show 3 more facts
- Commons category
- Finite state machine
- opposite of
- deterministic finite automata
- short name
- НКА
Sources (2)
via Wikidata · CC0