Define the languages accepted by NFA and DFA?
Answers
Answered by
0
hyy mates
The set of all strings accepted by an NFA is the language the NFA accepts. This language is a regular language. For every NFA a deterministic finite automaton (DFA) can be found that accepts the same language.
Similar questions