# unambiguous finite automaton

> special kind of a nondeterministic finite automaton (NFA). Each deterministic finite automaton (DFA) is an UFA, but not vice versa. DFA, UFA, and NFA recognize exactly the same class of formal languages

**Wikidata**: [Q1306211](https://www.wikidata.org/wiki/Q1306211)  
**Wikipedia**: [English](https://en.wikipedia.org/wiki/Unambiguous_finite_automaton)  
**Source**: https://4ort.xyz/entity/unambiguous-finite-automaton