Suppose that L1 is a regular language and L2 is a context-free language. Which one of the following languages is NOT necessarily c…
Let <M> denote an encoding of an automaton M. Suppose that Σ = {0,1}. Which of the following languages is/are NOT recursive?
The number of strings of length 100 accepted by the below pushdown automaton is _______________.
Let L be a subset of {0,1}* be an arbitrary regular language accepted by a minimal DFA with k states. Which one of the following l…
Let L1 be a regular language and L2 be a context-free language. Which of the following languages is/are context-free?
Consider the following two statements about regular languages: S1: Every infinite regular language contains an undecidable languag…
Free account benefits
Public PYQs and reference pages stay free. Sign in when you want GATEverse to remember what you studied and guide what to practise next.