Solved

Languages Are Proved to Be Regular or Non Regular Using

Question 20

Multiple Choice

Languages are proved to be regular or non regular using pumping lemma.

A) True
B) False
C) Not always true
D) can't say anything

Related Questions

Q15: Which of the following assertions about Turing

Q16: The regular expression have all strings in

Q17: For s ? (0+1)* let d(s) denote

Q18: Suppose that a problem A is known

Q19: If an effectively solvable problem has answered

Q21: The languages -------------- are the examples of

Q22: _ states are called the halt states.<br>A)ACCEPT

Q23: Let L<sub>1</sub> be a recursive language, and

Q24: Consider the regular language L =(111+11111)*. The

Q25: The PDA is called non-deterministic PDA when