a) a(a*Ub*)b
b) a*(aUb)b*
c) a(a*b*)b
d) None of the mentioned
Find a regular expression for a grammar which generates a language which states : L contains a set of strings starting w
-
answerhappygod
- Site Admin
- Posts: 899604
- Joined: Mon Aug 02, 2021 8:13 am
Find a regular expression for a grammar which generates a language which states : L contains a set of strings starting w
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!