Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:05142173n
Noun Concept
JA
No term available
EN
In automata theory, an unambiguous finite automaton is a nondeterministic finite automaton such that each word has at most one accepting path. Each deterministic finite automaton is an UFA, but not vice versa. Wikipedia
Relations
Sources
IS A
非決定性有限オートマトン
HAS KIND
決定性有限オートマトン

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