Question: 1. Prove that the language L1 = {ab | n > 0} is not regular. 2. Prove that the language L2 = {wwR I w{a,

1. Prove that the language L1 = {a"b" | n > 0} is not regular. 2. Prove that the language L2 = {wwR I w{a, b}*} is not regular
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
