Question

In an NFA and a DFA, what is the difference between an accepting state and a...

In an NFA and a DFA, what is the difference between an accepting state and a reachable state?

Engineering   Computer-Science   
0 0
Add a commentTranscribed image text
Next >

Homework Answers

Answer #1

A reachable and accepting state can be found in both DFA and NFA. The main difference between two states is the continuity of the machine after reaching that specific state.

A reachable state is a state that can be reached from current state by using the input string. From this state there can be another reachable or unreachable state.

An accepting state is the final state. It is a state in which machine halts and there is no input left in the string. Hence, at this state there is no further state to move on to.

0 0
Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Log In

Sign Up

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
N is a NFA with s states, all of which are reachable from the start state,...
N is a NFA with s states, all of which are reachable from the start state, and a single accepting state. M is a DFA obtained by applying from N. How many states in M will be reachable from the start state? How many accepting states in M will be reachable from the start state?
Theory of Computation Please provide explanation too on how it works a. Give an NFA recognizing...
Theory of Computation Please provide explanation too on how it works a. Give an NFA recognizing the language (01 U 001 U 010)*. b. Convert this NFA to an equivalent DFA. Give only the portion of the DFA that is reachable from the start state.
What does it mean to contruct a NFA with 2 layers of the same DFA ?
What does it mean to contruct a NFA with 2 layers of the same DFA ?
Consider the NFA N with states labeled q1, q2 and q3, where q1 is the start...
Consider the NFA N with states labeled q1, q2 and q3, where q1 is the start state and q3 is the only final (accepting) state. The transition function for N is δ(q1,a) = {q1}, δ(q1,b) = {q1,q2},  δ(q2,a) = {q3}, δ(q2,b)= ∅, δ(q3,a)= ∅, and δ(q3,b)= ∅. Let L be the language recognized by N i.e. L(N). a) Draw the state diagram for N. b) Describe in plain English what's in the language L. c) Via the construction NFA to DFA,...
Consider the NFA N with states labeled q1, q2 and q3, where q1 is the start...
Consider the NFA N with states labeled q1, q2 and q3, where q1 is the start state and q2 and q3 are the final (accepting) states. The transition function for N is δ(q1,a) = {q1}, δ(q1,b) = {q1,q2},  δ(q2,a) = {q3}, δ(q2,b)= ∅, δ(q3,a)= ∅, and δ(q3,b)= ∅. Let L be the language recognized by N i.e. L(N). a) Draw the state diagram for N. b) Describe in plain English what's in the language L. c) Via the construction NFA to...
Write a reflective journal on Grammars, Finite Automata (NFA and DFA), PDA, and Turing Machine (TM)...
Write a reflective journal on Grammars, Finite Automata (NFA and DFA), PDA, and Turing Machine (TM) for about one to one and half pages
Design a DFA accepting the language of all strings over Σ = {0, 1} with the...
Design a DFA accepting the language of all strings over Σ = {0, 1} with the property that the number of 0s and the number of 1s in a string are both odd.
1.1). The alphabet is {a, b}. Give the state diagram of the DFA recognizing the language:...
1.1). The alphabet is {a, b}. Give the state diagram of the DFA recognizing the language: {w | w has an odd number of a’s and at least two b's}. Show the steps! 1.2). Give the state diagram of the DFA which recognizes the complement of the above language in 1.1. Use 1.1 to answer 1.2 **I ONLY NEED HELP WITH 1.2* PLEASE*
What is the difference between semiclassical and quantum (number state) ?
What is the difference between semiclassical and quantum (number state) ?
what is the difference between federal and state health care policies
what is the difference between federal and state health care policies
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT