Devbrat posted an Question
September 02, 2020 • 20:55 pm 30 points
  • UGC NET
  • Computer Science & Applications

( a la, b, c). a palindrome is a word such that w = wr, that is, it reads the same backward and forward. l consists of all palindromes of length less than or eq

Draw a finite automata for the following language ( A la, b, c). A palindrome is a word such that w = wR, That is, it reads the same backward and forward. L consists of all palindromes of length less than or equal to 6.

1 Answer(s) Answer Now
  • 0 Likes
  • 1 Comments
  • 0 Shares
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