Which of the following are decidable? 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

Keep practicing — related questions

• Which of the following statements true?
• Which of the following problems are decidable? 1) Does a given program ever produce an output? 2) If L is c...
• Let L1 be a regular language, L2 be a deterministic context-free language and L3 a recursively enumerable, ...
• Let L1 be a regular language, L2 be a deterministic context-free language and L3 a recursively enumerable, ...
• Which of the following is not true for deterministic context free languages?
• Which of the following statements is false?
• Which of the following statements is false?
• Let $P$ be a regular language and $Q$ be a context-free language such that $Q \subseteq P$. (For example, l...