Devbrat posted an Question
September 27, 2020 • 07:15 am 30 points
  • UGC NET
  • Computer Science & Applications

Example: convert the following reqular expression to finite automata. (a) (ab) a (b) ((a + b)+ ba)* b a

Example: Convert the following reqular expression to finite automata. (a) (ab) a (b) ((a + b)+ ba)* b a please explain me how these conversion from regular expression to automata is done.

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