this is a problem iv nt been able to solve..tried still not getting an answer
Imagine that an NFA is divided into good and bad states represented by G and B resp..also G and B are mutually exclusive..now a string is accpted by the new NFA only if all computations on w(string) end either in the neutral state or the good state but not in the bad state..we have to proove that the language accpted by this are regular languages.
plz help solving me this..help appreciated

I'm not sure I understand your homework assignment.

You have three halt states: G (good), neutral, and B (bad).

However, your NFA only accepts for G and neutral. Hence, you really only have two halt states: G (good) and neutral.

This is all the information you have given me. With what you know (that I might not) about your NFA, can you prove that it is a regular language?

Hint: what is the definition/properties of a regular language, and what is the definition/properties of an NFA? (Or DFA, if you have already seen proof that a DFA and an NFA are equivalent).

I will restate the whole problem..the one that was given to me..
Suppose we alter the defination of an NFA so that we now identify 2 types of states in its state set Q:the good states G which is a subset of Q and the Bad states B which is a subset of Q,where G and B are mutually exclusive.We also alter the defination of acceptace:the automaton now accepts input w if,considering all possible computations on w,some computation ends in G and no computation ends in B.Call this new type of NFA a GOOD-BAD-NFA.
Proove that th class of languages recognized by GOOD-BAD-NFAs is the class of regular languages.

OK, so there are no neutral states.

I'm afraid I can't give you much more help than I already have, since this homework is a test of definitions.

Hint: if the modified NFA cannot halt on B, then what difference does it make if B is part of the automaton?

shomashoma, remember that two sets S and T are equal if S is a subset of T and T is a subset of S. You know that the set of regular languages are those accepted by DFAs and NFAs. Hint hint.

What if all the halting states that existed before the automata was modified are now the bad states..den how would any language be accepted???

see the thing is that it is mentioned that all possible computations on the string should end in good states only..If for example a state on application of say 0 goes on a good state as well as a bad state..den that string is not accpeted..this is mentioned in the question written above..So what wud happn if say the language for the original NFA os say 0*1..and all the 1 point to atleast 1 bad state..nd ya we could convert the NFA to the DFA but the DFA would fail in the above mentioned scenario..!!so what do v do??

There is no converting, just reasoning related to sets.

I could go to Ireland and speak to someone in Spanish, but I would get deported. (Just because someone who speaks Spanish can go and speak it in Ireland does not mean that he will be accepted by the Irish people.)

We are really at our limits for explaining things more clearly for you without just giving the answer away (I would argue that we already did...)

Think about it a little...

[EDIT] By the way, I'm not being rude. Everything in this post applies directly to your problem.