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

Pronunciations

• British English

  /ˌʌnæmˈbɪɡjʊəs ˈfaɪnaɪt ɔːˈtɒmətən/Open converter

• American English

  /ˌʌnæmˈbɪɡjəwəs ˈfaɪˌnaɪt ɑˈtɑməˌtɑn/Open converter

These IPA transcriptions are generated from the name above. Proper names may have other pronunciations, and current converter results may differ. How transcription works

Entity details on Wikidata

Categories: