Computer Science Engineering (CSE) Exam > Computer Science Engineering (CSE) Questions > If the final states and non-final states in t...
Start Learning for Free
If the final states and non-final states in the DFA below are interchanged, then which of the following languages over the alphabet {a,b} will be accepted by the new DFA?
- a)Set of all strings that do not end with ab
- b)Set of all strings that begin with either an a or a b
- c)Set of all strings that do not contain the substring ab,
- d)The set described by the regular expression b*aa*(ba)*b*
Correct answer is option 'A'. Can you explain this answer?
| FREE This question is part of | Download PDF Attempt this Test |
Verified Answer
If the final states and non-final states in the DFA below are intercha...
Seemingly, DFA obtained by interchanging final and non-final states will be complement of the given regular language. So, to prove that a family of string is accepted by complement of L, we will in turn prove that it is rejected by L.
(A). Set of all strings that do not end with ab - This statement could be proved right by looking at the b labeled incident edges on the final states and a labeled edges preceding them. Complement of the given DFA will have first two states as final states. First state doesn’t have any b labeled edge that has a labeled edge prior to it. Similarly, second final state doesn’t have any such required b labeled edge. Similarly, it could be proven that all the strings accepted by the given DFA end with ab. Now that L ∪ complement(L) = (a + b) ∗ , L should be the set of all the strings ending on ab and complement(L) should be set of all the strings that do not end with ab. [CORRECT]
(B). Set of all strings that begin with either an a or ab - This statement is incorrect. To prove that we just have to show that a string beginning with a or ab exists, which is accepted by the given DFA. String abaab is accepted by the given DFA, hence it won’t be accepted by its complement. [INCORRECT]
(C). Set of all strings that do not contain the substring ab - To prove this statement wrong, we need to show that a string exists which doesn’t contain the substring ab and is not accepted by current DFA. Hence, it will be accepted by its complement, making this statement wrong. String aba is not accepted by this DFA. [INCORRECT]
(D). The set described by the regular expression b ∗ aa ∗ (ba) ∗ b ∗ - String abaaaba is not accepted by the given DFA, hence accepted by its com
(A). Set of all strings that do not end with ab - This statement could be proved right by looking at the b labeled incident edges on the final states and a labeled edges preceding them. Complement of the given DFA will have first two states as final states. First state doesn’t have any b labeled edge that has a labeled edge prior to it. Similarly, second final state doesn’t have any such required b labeled edge. Similarly, it could be proven that all the strings accepted by the given DFA end with ab. Now that L ∪ complement(L) = (a + b) ∗ , L should be the set of all the strings ending on ab and complement(L) should be set of all the strings that do not end with ab. [CORRECT]
(B). Set of all strings that begin with either an a or ab - This statement is incorrect. To prove that we just have to show that a string beginning with a or ab exists, which is accepted by the given DFA. String abaab is accepted by the given DFA, hence it won’t be accepted by its complement. [INCORRECT]
(C). Set of all strings that do not contain the substring ab - To prove this statement wrong, we need to show that a string exists which doesn’t contain the substring ab and is not accepted by current DFA. Hence, it will be accepted by its complement, making this statement wrong. String aba is not accepted by this DFA. [INCORRECT]
(D). The set described by the regular expression b ∗ aa ∗ (ba) ∗ b ∗ - String abaaaba is not accepted by the given DFA, hence accepted by its com
|
Explore Courses for Computer Science Engineering (CSE) exam
|
|
Similar Computer Science Engineering (CSE) Doubts
Top Courses for Computer Science Engineering (CSE)View all
If the final states and non-final states in the DFA below are interchanged, then which of the following languages over the alphabet {a,b} will be accepted by the new DFA?a)Set of all strings that do not end with abb)Set of all strings that begin with either an a or a bc)Set of all strings that do not contain the substring ab,d)The set described by the regular expression b*aa*(ba)*b*Correct answer is option 'A'. Can you explain this answer?
Question Description
If the final states and non-final states in the DFA below are interchanged, then which of the following languages over the alphabet {a,b} will be accepted by the new DFA?a)Set of all strings that do not end with abb)Set of all strings that begin with either an a or a bc)Set of all strings that do not contain the substring ab,d)The set described by the regular expression b*aa*(ba)*b*Correct answer is option 'A'. Can you explain this answer? for Computer Science Engineering (CSE) 2024 is part of Computer Science Engineering (CSE) preparation. The Question and answers have been prepared according to the Computer Science Engineering (CSE) exam syllabus. Information about If the final states and non-final states in the DFA below are interchanged, then which of the following languages over the alphabet {a,b} will be accepted by the new DFA?a)Set of all strings that do not end with abb)Set of all strings that begin with either an a or a bc)Set of all strings that do not contain the substring ab,d)The set described by the regular expression b*aa*(ba)*b*Correct answer is option 'A'. Can you explain this answer? covers all topics & solutions for Computer Science Engineering (CSE) 2024 Exam. Find important definitions, questions, meanings, examples, exercises and tests below for If the final states and non-final states in the DFA below are interchanged, then which of the following languages over the alphabet {a,b} will be accepted by the new DFA?a)Set of all strings that do not end with abb)Set of all strings that begin with either an a or a bc)Set of all strings that do not contain the substring ab,d)The set described by the regular expression b*aa*(ba)*b*Correct answer is option 'A'. Can you explain this answer?.
If the final states and non-final states in the DFA below are interchanged, then which of the following languages over the alphabet {a,b} will be accepted by the new DFA?a)Set of all strings that do not end with abb)Set of all strings that begin with either an a or a bc)Set of all strings that do not contain the substring ab,d)The set described by the regular expression b*aa*(ba)*b*Correct answer is option 'A'. Can you explain this answer? for Computer Science Engineering (CSE) 2024 is part of Computer Science Engineering (CSE) preparation. The Question and answers have been prepared according to the Computer Science Engineering (CSE) exam syllabus. Information about If the final states and non-final states in the DFA below are interchanged, then which of the following languages over the alphabet {a,b} will be accepted by the new DFA?a)Set of all strings that do not end with abb)Set of all strings that begin with either an a or a bc)Set of all strings that do not contain the substring ab,d)The set described by the regular expression b*aa*(ba)*b*Correct answer is option 'A'. Can you explain this answer? covers all topics & solutions for Computer Science Engineering (CSE) 2024 Exam. Find important definitions, questions, meanings, examples, exercises and tests below for If the final states and non-final states in the DFA below are interchanged, then which of the following languages over the alphabet {a,b} will be accepted by the new DFA?a)Set of all strings that do not end with abb)Set of all strings that begin with either an a or a bc)Set of all strings that do not contain the substring ab,d)The set described by the regular expression b*aa*(ba)*b*Correct answer is option 'A'. Can you explain this answer?.
Solutions for If the final states and non-final states in the DFA below are interchanged, then which of the following languages over the alphabet {a,b} will be accepted by the new DFA?a)Set of all strings that do not end with abb)Set of all strings that begin with either an a or a bc)Set of all strings that do not contain the substring ab,d)The set described by the regular expression b*aa*(ba)*b*Correct answer is option 'A'. Can you explain this answer? in English & in Hindi are available as part of our courses for Computer Science Engineering (CSE).
Download more important topics, notes, lectures and mock test series for Computer Science Engineering (CSE) Exam by signing up for free.
Here you can find the meaning of If the final states and non-final states in the DFA below are interchanged, then which of the following languages over the alphabet {a,b} will be accepted by the new DFA?a)Set of all strings that do not end with abb)Set of all strings that begin with either an a or a bc)Set of all strings that do not contain the substring ab,d)The set described by the regular expression b*aa*(ba)*b*Correct answer is option 'A'. Can you explain this answer? defined & explained in the simplest way possible. Besides giving the explanation of
If the final states and non-final states in the DFA below are interchanged, then which of the following languages over the alphabet {a,b} will be accepted by the new DFA?a)Set of all strings that do not end with abb)Set of all strings that begin with either an a or a bc)Set of all strings that do not contain the substring ab,d)The set described by the regular expression b*aa*(ba)*b*Correct answer is option 'A'. Can you explain this answer?, a detailed solution for If the final states and non-final states in the DFA below are interchanged, then which of the following languages over the alphabet {a,b} will be accepted by the new DFA?a)Set of all strings that do not end with abb)Set of all strings that begin with either an a or a bc)Set of all strings that do not contain the substring ab,d)The set described by the regular expression b*aa*(ba)*b*Correct answer is option 'A'. Can you explain this answer? has been provided alongside types of If the final states and non-final states in the DFA below are interchanged, then which of the following languages over the alphabet {a,b} will be accepted by the new DFA?a)Set of all strings that do not end with abb)Set of all strings that begin with either an a or a bc)Set of all strings that do not contain the substring ab,d)The set described by the regular expression b*aa*(ba)*b*Correct answer is option 'A'. Can you explain this answer? theory, EduRev gives you an
ample number of questions to practice If the final states and non-final states in the DFA below are interchanged, then which of the following languages over the alphabet {a,b} will be accepted by the new DFA?a)Set of all strings that do not end with abb)Set of all strings that begin with either an a or a bc)Set of all strings that do not contain the substring ab,d)The set described by the regular expression b*aa*(ba)*b*Correct answer is option 'A'. Can you explain this answer? tests, examples and also practice Computer Science Engineering (CSE) tests.
|
|
Explore Courses for Computer Science Engineering (CSE) exam
|
|
Suggested Free Tests
Signup for Free!
Signup to see your scores go up within 7 days! Learn & Practice with 1000+ FREE Notes, Videos & Tests.
|
© EduRev
|
Education Revolution
|
|
Signup to see your scores
go up within 7 days!
Access 1000+ FREE Docs, Videos and Tests
Takes less than 10 seconds to signup