answersLogoWhite

0

A deterministic finite automaton will have a single possible output for a given input. The answer is deterministic because you can always tell what the output will be.

A nondeterministic finite automaton will have at least one input which will cause a "choice" to be made during a state transition. Unlike a DFA, one input can cause multiple outputs for a given NFA.

User Avatar

Wiki User

15y ago

What else can I help you with?

Related Questions

What is the difference between deterministic finite automata and non deterministic finite automata?

A deterministic Finite Automata)DFA will have a single possible output for a given input.The answer is deterministic because you can always feel what the output will be.A (Nondeterministic Finite Automata)NFA will have at least one input which will cause a "choice" to be made during a state transition,unlike a (deterministic Finite Automata)DFA one input can cause multiple outputs for a given (Nondeterministic Finite Automata)NFA.


What is full form of DFA and NFA?

DFA - deterministic finite automata NFA - non-deterministic finite automata


Are all deterministic finite automata (DFAs) also non-deterministic finite automata (NFAs)?

No, not all deterministic finite automata (DFAs) are also non-deterministic finite automata (NFAs). DFAs have a single unique transition for each input symbol, while NFAs can have multiple transitions for the same input symbol.


Is it possible to show that all deterministic finite automata (DFA) are decidable?

Yes, it is possible to show that all deterministic finite automata (DFA) are decidable.


What does dfa stand for?

Deterministic finite state automata


What is dfa and nfa?

DFA - Deterministic Finite Automata NFA - Non-Deterministic Finite Automata Both DFAs and NFAs are abstract machines which can be used to describe languages.


Define the languages accepted by NFA and DFA?

In general, finite state machines can model regular grammars. Deterministic finite automata can represent deterministic context-free grammars. Non-deterministic finite automata can represent context-free grammars.


Is it possible to demonstrate that all deterministic finite automata (DFA) are in the complexity class P?

Yes, it is possible to demonstrate that all deterministic finite automata (DFA) are in the complexity class P.


What is difference between finite state automaton and transition graph?

finite automata


Difference between DFA and NFA?

Hi, 1. DFA cannot use empty string transition and NFS can use empty string transition. 2. It use one machine but it use multiple machine. 3. DFA is one state transition but NFA react according to some symbol.


Difference between NFA and NDFA in automata?

when power feature non-determinism is added to finite automata then it is known as NDFA when an input is read the automata each step may chose to go to any of the several possible(legal) "next states " . Since the choice is not determined by anything , therefore , it is valled non deterministic.


How can the union of two deterministic finite automata (DFA) be achieved?

The union of two deterministic finite automata (DFA) can be achieved by creating a new DFA that combines the states and transitions of the original DFAs. This new DFA will accept a string if either of the original DFAs would accept that string.