answersLogoWhite

0


Best Answer

The state machine described in the previous section is a deterministic finite automaton, in which each state is unique. What would make a finite automaton nondeterministic is if each state was not. For the example, if the state machine allowed the input to have any letter as the second letter for the word "person" to transition to the next, then the next state would not be unique, making it a nondeterministic finite automaton.

User Avatar

Wiki User

βˆ™ 12y ago
This answer is:
User Avatar
More answers
User Avatar

Wiki User

βˆ™ 15y ago

A deterministic finite automaton is an automaton where for each state there exits exactly one following state for each possible input. A non-deterministic finite automaton may have multiple (or no) following states for a given state and input.

This answer is:
User Avatar

User Avatar

Wiki User

βˆ™ 12y ago

ghanta pakad lo mera . . . . . Agli baar try krna

This answer is:
User Avatar

User Avatar

Wiki User

βˆ™ 11y ago

deterministic have terminal nd but a non terminal does not have

This answer is:
User Avatar

User Avatar

Wiki User

βˆ™ 10y ago

advantages of deterministic finite automata

This answer is:
User Avatar

User Avatar

Wiki User

βˆ™ 12y ago

l={a b^n a^n :n>=2 ,m>=3 } give dfa

This answer is:
User Avatar

Add your answer:

Earn +20 pts
Q: Difference between deterministic finite automaton and non deterministic finite automaton?
Write your answer...
Submit
Still have questions?
magnify glass
imp
Continue Learning about Engineering

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.


Can DFA simulate NFA?

Yes, a Deterministic Finite Automaton (DFA) can simulate a Non-deterministic Finite Automaton (NFA). This can be achieved by constructing an equivalent DFA for a given NFA using the subset construction method. In this method, each state of the DFA represents a set of states of the NFA, and transitions are defined based on the transitions of the NFA. By following this approach, a DFA can effectively simulate the behavior of an NFA.


Distinguish between dfa and nfa?

DFA stands for Deterministic finite automaton and NFA stands for Nondeterministic finite automaton.Formally, an automaton is made up of: were delta is the transition function. In a DFA, delta takes as input a state and letter and returns only one state. In an NFA, delta takes as input a state and letter but returns a set of states.An NFA accepts a word iff there exists a run of the automaton on it (intuitively, the automaton guesses an accepting run). A DFA has only one run on every word and therefore accepts a word iff the single run on it is accepting.


Difference between active and passive elements?

Active components can deliver a finite amount of power for some finite amount of time period where passive components can not deliver finite amount of power for some finite amount of time.


Describe how lexical analyzer generators are used to translate regular expressions into deterministic finite automata?

Lexical analyzer generators translate regular expressions (the lexical analyzer definition) into finite automata (the lexical analyzer). For example, a lexical analyzer definition may specify a number of regular expressions describing different lexical forms (integer, string, identifier, comment, etc.). The lexical analyzer generator would then translate that definition into a program module that can use the deterministic finite automata to analyze text and split it into lexemes (tokens).

Related questions

Difference between deterministic finite automata and non deterministic finite automata?

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.


What did nfa stand for?

NFA - Non-deterministic Finite Automaton, aka NFSM (Non-deterministic Finite State Machine)


What is difference between finite state automaton and transition graph?

finite automata


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 relation between regular languages finite automaton and regular grammars?

finite automaton is the graphical representation of language and regular grammar is the representation of language in expressions


What is full form of DFA and NFA?

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


Distinguish between dfa and nfa?

DFA stands for Deterministic finite automaton and NFA stands for Nondeterministic finite automaton.Formally, an automaton is made up of: were delta is the transition function. In a DFA, delta takes as input a state and letter and returns only one state. In an NFA, delta takes as input a state and letter but returns a set of states.An NFA accepts a word iff there exists a run of the automaton on it (intuitively, the automaton guesses an accepting run). A DFA has only one run on every word and therefore accepts a word iff the single run on it is accepting.


What is a biautomaton?

A biautomaton is a finite automaton which arbitrarily alternates between reading the input from the left and from the right.


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.


What is better Finite Automata or Regular Expression?

Finite Automata and Regular Expressions are equivalent. Any language that can be represented with a regular expression can be accepted by some finite automaton, and any language accepted by some finite automaton can be represented by a regular expression.


Why a finite automaton is called finite?

I would guess that is because it has a finite number of different states. (It is also known as a finite-state machine.)


What does dfa stand for?

Deterministic finite state automata