a) The language L={a^n b^n |n>0 } is regular
b) The language L={a^n |n is prime } is regular
c) The language L={w|w has 3k+1 b’s for some k } is regular
d) None of the mentioned
Which one of the following is TRUE?
-
answerhappygod
- Site Admin
- Posts: 899604
- Joined: Mon Aug 02, 2021 8:13 am
Which one of the following is TRUE?
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!