Grammars that can be translated to DFAs is __________

Grammars that can be translated to DFAs is ___________

A

Left linear grammar

B

Right linear grammar

C

Generic grammar

D

All of the mentioned

NFAs are ________ DFAs.

A

Larger than

B

More expressive than

C

Less expressive than

D

Equally expressive as

Like DFAs, NFAs only recognize regular languages.

A

True

B

False

DFAs, NFAs, and ε-NFA s are equivalent.

A

True

B

False

If a point (x, y, z) is to be translated by an amount dx, dy and dz respectively, then what will be the value of the new translated points (x1, y1, z1)?

A

x1 = x y1 = y z1 = z

B

x1 = dx y1 = dy z1 = dz

C

x1 = x + dx y1 = y + dy z1 = z + dz

D

x1 = x – dx y1 = y – dy z1 = z – dz

Which of the following can generate Unrestricted grammars?

A

Pentonnen Normal form

B

Floyd Normal form

C

Greibach Normal form

D

None of the mentioned

A network with named nodes and labeled arcs that can be used to represent certain natural language grammars to facilitate parsing.

A

Tree Network

B

Star Network

C

Transition Network

D

Complete Network

Assume the statements S1 and S2 given as: S1: Given a context free grammar, 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?

A

S1 is correct and S2 is not correct

B

Both S1 and S2 are correct

C

Both S1 and S2 are not correct

D

S1 is not correct and S2 is correct

In Right-Linear grammars, all productions have the form: A → xB.

A

True

B

False

Regular Grammars generate Regular Languages.

A

True

B

False

Grammars that can be translated to DFAs is __________

Related Questions