Solved

Let L Be a Language Defined Over an Alphabet ?,Then

Question 7

Multiple Choice

Let L be a language defined over an alphabet ?,then the language of strings , defined over ?, not belonging to L denoted by LC or L. is called :

A) Non regular language of L
B) Complement of the language L
C) None of the given
D) All of above

Related Questions

Q2: Consider a language L for which there

Q3: The concept of FSA is much used

Q4: The Family of recursive language is not

Q5: Recursive languages are<br>A)A proper superset of CFL<br>B)Always

Q6: The logic of pumping lemma is a

Q8: Which of the following statements is wrong?<br>A)The

Q9: Fred created a new automaton model which

Q10: If a language is denoted by a

Q11: Grammar that produce more than one Parse

Q12: Consider the following problem x. Given a