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:

Which of the following regular expression identities are true ?
For every context free grammar (G) there exists an algorithm that passes any w ∈ L(G) in number of steps proportional to
LL grammar for the language L = {a^n b^m c^n+m | m≥0, n≥0} is
Shift-Reduce parsers perform the following :
The context-free languages are closed for:

(i) Intersection                          (ii) Union
(iii) Complementation             (iv) Kleene Star
The equivalent production rules corresponding to the production rules

S → Sα1 | Sα2 | β1 | β2 
Recursive Descent Parsers are a type of:
Match the following:

List-I                                                            List-II

a. Chomsky Normal form                       i.  S→ bSS|aS|c

b. Greibach Normal form                        ii.  S→ aSb|ab

c. S-grammar                                           iii. S→ AS|a

                                                                         A→ SA|b

d. |LL grammar                                        iv. S→ aBSB

                                                                         B→ b

Codes:
a       b       c       d
Given the following expressions of a grammar

E --> E * F / F + E / F
F --> F - F / id

Which of the following is true ?
Which of the following language is regular?

View All Questions on: Theory of Computation(TOC)

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.