MCQ IN COMPUTER SCIENCE & ENGINEERING

Detailed explanation-1: -The non-Kleene Star operation accepts the following string of finite length over set A = 0, 1 | where string s contains even number of 0 and 1a)01, 0011, 010101b)0011, 11001100c), 0011, 11001100d), 0011, 11001100Correct answer is option ‘B’.

Detailed explanation-2: -Which of the following strings is NOT in the Kleene star of the language 011, 10, 110? Explanation: Every string in the language 011, 10, 110* has to be formed from zero or more uses of the strings 011, 10, and 110.

Detailed explanation-3: -Number of states require to accept string ends with 10. d) can’t be represented. Explanation: This is minimal finite automata. 4.

Detailed explanation-4: -a)Input alphabetb)Transition functionc)Initial Stated)Output AlphabetCorrect answer is option ‘D’. Can you explain this answer?, a detailed solution for Which of the following is a not a part of 5-tuple finite automata? a)Input alphabetb)Transition functionc)Initial Stated)Output AlphabetCorrect answer is option ‘D’.

Detailed explanation-5: -Explanation: According to the question, minimum of 3 states are required to recognize an octal number divisible by 3.