Question: 1 . ( 2 marks ) Let = f 0 ; 1 g and consider languages A = f 0 1 ; 0 0 ;

1.(2 marks) Let = f0; 1g and consider languages A = f01; 00; 1g, B = f10; 11; 0g. (a) Write down all strings in the set A B. How many strings there are in A B? (b) Write down all strings in the set B A. How many string there are in B A?

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 Programming Questions!