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
shomashoma
0
Newbie Poster
Recommended Answers
Jump to PostI'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 …
Jump to PostOK, 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 …
Jump to Postshomashoma, 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.
All 9 Replies
Duoas
1,025
Postaholic
Featured Poster
shomashoma
0
Newbie Poster
Duoas
1,025
Postaholic
Featured Poster
sarehu
84
Posting Whiz in Training
shomashoma
0
Newbie Poster
shomashoma
0
Newbie Poster
sarehu
84
Posting Whiz in Training
Duoas
1,025
Postaholic
Featured Poster
rajmitul
0
Newbie Poster
Be a part of the DaniWeb community
We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts meeting, networking, learning, and sharing knowledge.