A directory of Objective Type Questions covering all the Computer Science subjects. Here you can access and discuss Multiple choice questions and answers for various compitative exams and interviews.

Discussion Forum

Que. The minimum number of states of the non-deterministic finite automation which accepts the language
{a b a bn| n  ≥  0} ∪ {a b an|n  ≥ 0} is 
a. 3
b. 4
c. 5
d. 6
Answer:5
Confused About the Answer? Ask for Details Here
Know Explanation? Add it Here

Similar Questions:

Shift-Reduce parsers perform the following :
Assume the statements S1 and S2 given as:

S1: Given a context free grammar G, there exists an algorithm for determining whether L(G) is infinite.
S2: There exists an algorithm to determine whether two context free grammars generate the same language.

Which of the following is true?
The equivalent production rules corresponding to the production rules

S→Sα1|Sα2|β1|β2 is
Given the following statements:

S1: If L is a regular language then the language {uv | u ∈  L, v ∈ LR } is also regular.
S2: L = {wwR} is regular language.

Which of the following is true?
Context-free Grammar (CFG) can be recognized by
Let A = {x | -1< x< 1} = B. The function f(x)=x/2 from A to B is:
Which sentence can be generated by S→d/bA, A→d/ccA:
Given the following statements:

S1: Every context-sensitive language L is recursive.
S2: There exists a recursive language that is not context sensitive.

Which statement is correct?
Regular expression a+b denotes the set:
Which of the following statements is false?
Get it on Google Play

GATE CSE Resources

Questions from Previous year GATE question papers

UGC NET Computer science Resources

UGC NET Previous year questions and practice sets

GATE CSE Online Test

Attempt a small test to analyze your preparation level. This GATE exam includes questions from previous year GATE papers.

UGC NET practice Test

Practice test for UGC NET Computer Science Paper. The questions asked in this NET practice paper are from various previous year papers.