Question: Question(Regular Language). The language L1 = {a sa | n > 0 and s *} is regular. The language L2 = {absa | n >0

Question(Regular Language).

Question(Regular Language). The language L1 = {a" sa" | n > 0

The language L1 = {a" sa" | n > 0 and s *} is regular. The language L2 = {absa" | n >0 and $ *}, however, is not regular. You may assume ? = {a,b}. 1. Prove that L is regular. 2. Prove that L2 is not regular

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!