Computer Science, asked by roshu7001, 11 months ago

Define the languages accepted by NFA and DFA?

Answers

Answered by Anonymous

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.

Previous Question

Next Question

Similar questions

Geography, 6 months ago

what is plain in geography...

Business Studies, 6 months ago

Discuss the current issues of ethical practice Pakistan markets (amid the current covid-19 Pandemic). What kind of problems have the firms been facing, and what should the leaders do about it ...

Biology, 6 months ago

Viruses have few biochemical pathways of their own. Does this make our work of making anti-viral medicines easier or difficult? Give reason for your answer.

Computer Science, 11 months ago

Why are computers so accurate?

Computer Science, 11 months ago

IN Artificial intelligence is subgoal satisfies control knowledge how?

Computer Science, 1 year ago

What is the strength of artificial intelligence?

Economy, 1 year ago

What is the role of fiscal policy in an economy?

Math, 1 year ago

What is the difference between vector and poit?