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
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.