Question: Any set of words is called a language. For example { 0 0 , 1 0 1 , 0 1 1 } and { w

Any set of words is called a language. For example
{00,101,011} and {w : w in {0,1}
,|w| is even}
are two languages, such that the first one is finite, and the second one is infinite and consists of all
binary words of even length.
Indicate whether each of the following languages over the alphabet {0,1} is finite or infiniteno
explanations required. If the language is finite, tell how many words it contains.
L1={0,11}
L2={0,1}
L1
L3={0,1}
11\cup {0}
1040
L4={w | w contains exactly 71s}
L5={w | w contains no 00}
L6={w | w contains at most 80s}\cap L4

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!