Question: Please answer True or False on the following: 1. Let L be a set of strings over the alphabet = { a, b }. If

Please answer True or False on the following:

1. Let L be a set of strings over the alphabet = { a, b }. If L is infinite, then L* must be infinite (L* is the Kleene closure of L)

2. Let L be a set of strings over the alphabet = { a, b }. Let ! L denote the complement of L. If L is finite, then ! L must be infinite.

3. Let L be a set of strings over the alphabet = { a, b }. Let ! L denote the complement of L. If L is infinite, then ! L must be finite.

4. Let L be a set of strings over the alphabet = { a, b }. If L is finite, then L* must be infinite.

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!