Devbrat posted an Question
August 31, 2020 • 21:35 pm 30 points
  • UGC NET
  • Computer Science & Applications

(c) a= {a, b}; l consists of all words whose final five symbols include two a's and three b's.

How can I draw a finite automata for the following language:- A= {a, b}; L consists of all words whose final five symbols include two a's and three b's.

1 Answer(s) Answer Now
  • 0 Likes
  • 1 Comments
  • 0 Shares
  • comment-profile-img>
    Komal bhati Best Answer

    refer the image.. hope you got it..

    cropped933061157801920317.jpg
    eduncle-logo-app

    what about string ababb?

    eduncle-logo-app

    in the question condition is the string ends with 2 a and 3 b.. so in the final we have to follow ...aabbb

    eduncle-logo-app

    but questions says includes! two a and 3 b not consecutive 2 a and 3b. right?

    eduncle-logo-app

    question says L consists of all words whose "final" five symbols include 2a and 3 bs.. and if they are not consecutive examiner doesn't mentioned it as a condition.. because all a and b are included in the words without any condition.. all states has input a and b.. so its a and b are final symbol. hope you got it..

    eduncle-logo-app

    and the string hi not contain the symbols below 6.. bc its a condition ends with so final states will be given string+1 alwz..

whatsapp-btn

Do You Want Better RANK in Your Exam?

Start Your Preparations with Eduncle’s FREE Study Material

  • Updated Syllabus, Paper Pattern & Full Exam Details
  • Sample Theory of Most Important Topic
  • Model Test Paper with Detailed Solutions
  • Last 5 Years Question Papers & Answers