Question
Download Solution PDFComprehension
A machine is represented by states Q, input alphabet Σ, transition function δ. Initial state qo and final state F. The machine accepts all the strings over Σ = {a,b}, which starts and ended with any combination of all alphabet and abb works/lies in all the strings to be accepted
For the above mentioned passage which of the following is correct?
Answer (Detailed Solution Below)
Option 3 : 
India's Super Teachers for all govt. exams Under One Roof
Detailed Solution
Download Solution PDFThe correct answer is Option 3.
Key Points
Option 1: The DFA transitions a → b → b directly to final state. But it lacks proper looping logic to verify intermediate characters. No trap state. Incorrect.
Option 2: Accepts strings only if they end with “abb”. But the question states the string can have “abb” anywhere. Incorrect.
Option 3: The DFA clearly detects “abb” and loops over further inputs. So, even strings like “aabb”, “baabbab”, “abba” will be accepted. Correct ✔
India’s #1 Learning Platform
Start Complete Exam Preparation
Daily Live MasterClasses
Practice Question Bank
Mock Tests & Quizzes
Trusted by 7.2 Crore+ Students