Menu

Question Discussion & Solution

MCQ

Q.

The basic limitation of finite automata is that

A

It can

B

It sometimes recognize grammar that are not regular.

C

It sometimes fails to recognize regular grammar.

D

All of the mentioned

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Login to Discuss

Similar Questions

MCQ

1.

The basic limitation of finite automata is that

A

it can

B

it sometimes recognize grammar that are not regular

C

it sometimes fails to recognize regular grammar

D

None of the above

Discussion

MCQ

2.

Given: ?= {a, b}L= {x??*|x is a string combination}?4 represents which among the following?

A

{aa, ab, ba, bb}

B

{aaaa, abab, ?, abaa, aabb}

C

{aaa, aab, aba, bbb}

D

All of the mentioned

Discussion

MCQ

3.

. How many DFA

A

16

B

26

C

32

D

64

Discussion

MCQ

4.

Transition function maps.

A

? * Q -> ?

B

Q * Q -> ?

C

? * ? -> Q

D

Q * ? -> Q

Discussion

MCQ

5.

The production Grammar is {S->aSbb,S->abb} is __________ grammar.

A

Type-3

B

Type-2

C

Type-1

D

Type-0

Discussion

More Theory of Automata Topics

Reqular Expressions

114 MCQs

Finite Automata

44 MCQs

Context Free Grammars

76 MCQs

Push Down Automata

37 MCQs

Regular and context free languages

65 MCQs

Pumping Lemma

14 MCQs

Turning Machine

14 MCQs