bn:05142173n
Noun Concept
IT
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