Consider the following context-free grammar G, where S, A, and B are the variables (non-terminals), a and b are the terminal symbo…
A regular language L is accepted by a non-deterministic finite automaton (NFA) with n states. Which of the following statement(s) …
Consider the following two languages over the alphabet {a,b}: L1 = { α β α | α in {a,b}+ AND β in {a,b}+ } L2 = { α β α | α in {a}…
Consider the following two languages over the alphabet {a,b,c}, where m and n are natural numbers. L1 = {\(a^{m}\) \(b^{m}\) c^(m+…
Which ONE of the following languages is accepted by a deterministic pushdown automaton?
Let G1, G2 be Context Free Grammars (CFGs) and R be a regular expression. For a grammar G, let L(G) denote the language generated …
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.