unambiguous finite automaton (Q1306211)
Jump to navigation
Jump to search
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
- UFA
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | 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 |
|
Statements
Identifiers
Sitelinks
Wikipedia(4 entries)
- dewiki Eindeutiger endlicher Automat
- enwiki Unambiguous finite automaton
- fawiki ماشین محدود غیرمبهم
- frwiki Automate fini inambigu