a) n
b) |y|
c) |x|
d) none of the mentioned
There exists a language L. We define a string w such that w∈L and w=xyz and |w| >=n for some constant integer n.What can
-
answerhappygod
- Site Admin
- Posts: 899604
- Joined: Mon Aug 02, 2021 8:13 am
There exists a language L. We define a string w such that w∈L and w=xyz and |w| >=n for some constant integer n.What can
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!