Is it true? Write Y=yes or N=no into the box corresponding to the statement
(-x V y V z) A-(x V yVz) is a 3CNF formula. (,y,z are atoms.)
It is decidable whether two context-free grammars generate the same language.
57n =O(74n)
Let M = (Q,,I,,qo,qa,q.) be a one tape nondeterministic Turing machine. If qou F Ci holds for some u E + and we have C; F Ci+i for all natural numbers i 1, then u L(M (Ci,C,... are configurations of M).
If there is an injective mapping from A to B, then the cardinality of B is greater than the cardinality of A.
If L'eR and L'<p L, then L ER.
Let D be an instance of the Post Correspondence Problem. Then every solution of D consists of at mostDdominoes.
We know, that for all languages L ENP there exist a deterministic Turing machine M satisfying L(M) = L.
Constructing a deterministic Turing machine of polynomial time complexity for TSP implies that we can construct a deterministic Turing machine of poly. nomial time complexity for all languages of NP
If a simple graph G of 8 vertices has a clique of size 3, then the complementary graph of G has a an independent set of size 5.
P NP there exists an NP-intermediate language.
Lpcp is in NP.
Linear bounded automata are specific deterministic Turing machines
The class of languages, that can be recognized by a linear bounded automaton contains the class of languages that can be recognized by a pushdown automa ton.
All languages of NPSPACE are decidable by a deterministic Turing machine