Question: Let = { x , ( , ) } , that is one has the characters x , the open parenthesis and the close parenthesis.
Let x that is one has the characters x the open parenthesis and the close parenthesis. Let L be the language whose strings have the same number of left parentheses as right parentheses and M be the language where all parentheses are balanced. Which of the following is true?
xxxx is in L but not in M
is in L but not in M
The shortest nonempty string in M has the length of
xx is in L but not in M
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
