Which of the following is a P-complete type of problem?
(a) Circuit Value problem
(b) Linear programming
(c) Context free grammar membership
(d) All of the mentioned
The question was posed to me in an interview.
Enquiry is from Problem Solvable in Polynomial Time in chapter Intractable Problems of Automata Theory