Home / Engineering / Theory of Computation and Compiler Design / Question
M
Q.) Which of the following are decidable ?
1. whether the intersection of two regular language is infinite.
2. whether a give context free language is regular
3. whether two push down automata accept the same language.
4. whether a given grammar is context free
Related MCQs on Theory of Computation and Compiler Design
Q. The string with zero characters is called___________.
Q. The percentage of time the system is up and running smoothly is referred as ________.
Q. FTP uses _____ parallel TCP connections to transfer a file
Q. Steganography follows the concept of security through obscurity.
Q. When 2 devices are connected through a dedicated line, it is topology.
Q. What will be the cost of the code if character ci is at depth di and occurs at frequency fi?
Discusssion
Login to discuss.