Home / Engineering / Theory of Computation / Question
M
Q.) Which of the following are decidable?
1) Whether the intersection of two regular language is infinite.
2) Whether a given 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
Q. Which command creates database objects like tables, views and indexes:
Q. Does Raspberry Pi need external hardware?
Q. Binary circuit elements have
Q. Suppose list1 is [3, 4, 5, 20, 5, 25, 1, 3], what is list1.count(5)?
Q. What is one of the common examples of a stack?
Q. what is the relationship of a filename to its inode
Q. Which of the following protocol below are suited for email retrieval?
Q. An investigation can be hindered by the following:
Q. Snapshot of the dta in the database at a given instant of time is called
Discusssion
Login to discuss.