Consider the following languages: I. { a^m b^n c^p d^q | m + p = n + q, where m, n, p, q >= 0 } II. { a^m b^n c^p d^q | m = n and …
Consider the following problems. L(G) denotes the language generated by grammar G. L(M) denotes the language accepted by machine M…
Let N be an NFA with n states. Let k be the number of states of a minimal DFA which is equivalent to N. Which one of the following…
The set of all recursively enumerable languages is:
Consider the following grammar where S is the start symbol, and a and b are terminal symbols. S → aSbS | bS | ε Which of the follo…
Let M be a nondeterministic finite automaton (NFA) with 6 states over a finite alphabet. Which of the following options CANNOT be …
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.