Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03499531n
Noun Concept
Categories: Finite automata
EN
nondeterministic finite automaton  Nondeterministic finite state machine  Epsilon closure  Extended transition function  NDFSM
EN
In automata theory, a finite-state machine is called a deterministic finite automaton, if each of its transitions is uniquely determined by its source state and input symbol, and reading an input symbol is required for each state transition. Wikipedia
Definitions
Relations
Sources
EN
In automata theory, a finite-state machine is called a deterministic finite automaton, if each of its transitions is uniquely determined by its source state and input symbol, and reading an input symbol is required for each state transition. Wikipedia
Finite-state machine Wikidata
IS A
finite-state machine
HAS KIND
unambiguous finite automaton
Wikipedia
EN
nondeterministic finite automaton
Wikidata
EN
nondeterministic finite automaton
Wikipedia Redirections
EN
Epsilon closure, Extended transition function, NDFSM, NFA (computer science), Non-deterministic finite automata, non-deterministic finite automaton, Non-deterministic finite state machine, Nondeterministic finite-state automaton, nondeterministic finite-state machine, nondeterministic finite automata, Nondeterministic finite Automaton, Nondeterministic Finite Automaton, Nondeterministic Finite automaton, Nondeterministic finite state automaton, Nondeterministic Finite State Machine, Nondeterministic finite state machine, Nondeterministic machine, Word automaton
Wikidata Alias
EN
NFA

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License