決定性有限オートマトン
1. Deterministic finite automatonIn the automata theory, a branch of theoretical computer science, a deterministic finite automaton (DFA)—also known as deterministic finite state machine—is a finite state machine that accepts/rejects finite strings of symbols and only produces a unique computation (or run) of the automaton for each input string. 'Deterministic' refers to the uniqueness of the computation.
Read “Deterministic finite automaton” on English Wikipedia
Read “決定性有限オートマトン” on Japanese Wikipedia
Read “Deterministic finite automaton” on DBpedia
Read “Deterministic finite automaton” on English Wikipedia
Read “決定性有限オートマトン” on Japanese Wikipedia
Read “Deterministic finite automaton” on DBpedia
Discussions
Log in to talk about this word.