Question 3
I. Whether the intersection of two regular languages is infinite II. Whether a given context-free language is regular III. Whether two push-down automata accept the same language IV. Whether a given grammar is context-free
Question 5
Question 7
Question 8
Consider two languages L1 and L2 each on the alphabet ∑. Let f : ∑ → ∑ be a polynomial time computable bijection such that (∀ x) [x ∈ L1 if f(x) ∈ L2]. Further, let f-1 be also polynomial time computable. Which of the following CANNOT be true?
Question 9
Given a Turing machine M over the input alphabet Σ, any state q of M And a word w∈Σ*, does the computation of M on w visit the state q?Which of the following statements about X is correct?
Question 10
Consider the following decision problems:
(P1) Does a given finite state machine accept a given string (P2) Does a given context free grammar generate an infinite number of strings
Which of the following statements is true?
There are 27 questions to complete.