• Courses
  • Tutorials
  • Jobs
  • Practice
  • Contests

Aptitude | GATE IT 2006 | Question 3

In the automaton below, s is the start state and t is the only final state.download1               Consider the strings u = abbaba, v = bab, and w = aabb. Which of the following statements is true?  


The automaton accepts u and v but not w


The automaton accepts each of u, v, and w


The automaton rejects each of u, v, and w


The automaton accepts u but rejects v and w


Please comment below if you find anything wrong in the above post
Feeling lost in the world of random DSA topics, wasting time without progress? It's time for a change! Join our DSA course, where we'll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 geeks!

Last Updated :
Share your thoughts in the comments