Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03499526n
Noun Concept
Categories: Finite automata
EN
deterministic finite automaton  deterministic finite-state machine  deterministic finite acceptor  deterministic finite automata  Deterministic finite autonoma
EN
In the theory of computation, a branch of theoretical computer science, a deterministic finite automaton —also known as deterministic finite acceptor, deterministic finite-state machine, or deterministic finite-state automaton —is a finite-state machine that accepts or rejects a given string of symbols, by running through a state sequence uniquely determined by the string. Wikipedia
Definitions
Relations
Sources
EN
In the theory of computation, a branch of theoretical computer science, a deterministic finite automaton —also known as deterministic finite acceptor, deterministic finite-state machine, or deterministic finite-state automaton —is a finite-state machine that accepts or rejects a given string of symbols, by running through a state sequence uniquely determined by the string. Wikipedia
A finite state machine accepting finite strings of symbols Wikipedia Disambiguation
Finite-state machine that accepts and rejects strings of symbols and only produces a unique computation (or run) of the automaton for each input string Wikidata
IS A
finite-state machine
unambiguous finite automaton
HAS KIND
semiautomaton
deterministic acyclic finite state automaton
HAS INSTANCE
tag system
Wikipedia
EN
deterministic finite automaton
Wikidata
EN
deterministic finite automaton
Wikipedia Redirections
EN
deterministic finite-state machine, deterministic finite automata, Deterministic Finite Automaton, Deterministic finite autonoma, deterministic finite state automaton, Deterministic finite state machine, DFA (computer science), DFSA, Finite deterministic automaton, local automaton, Myhill graph, Read-only right-moving Turing machines, read-only right moving Turing machines, Read only right moving Turing Machines
Wikidata Alias
EN
deterministic finite acceptor, deterministic finite state machine, DFA, DFSM

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