Multiple Choice
The languages -------------- are the examples of non regular languages.
A) PALINDROME and PRIME
B) PALINDROME and EVEN-EVEN
C) EVEN-EVEN and PRIME
D) FACTORIAL and SQURE
Correct Answer:
Verified
Correct Answer:
Verified
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
Q20: Languages are proved to be regular or
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