Devbrat Anuragi Asked a Question
August 31, 2020 4:05 pmpts 30 pts
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)
  • 0 Likes
  • 1 Comments
  • Shares
  • Komal bhati Best Answer
    refer the image.. hope you got it..
    • cropped933061157801920317.jpg
    Likes(0) Reply(5)
    Devbrat Anuragi
    what about string ababb?