A regular Grammar is a _________...

MCQ

A regular Grammar is a _________

CFG

Non CFG

English Grammar

None of the mentioned

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

MCQ

Which of the following statement is false?

Let L is a language accepted by a PDA P then there exist a CFG G L such that L(G) =N(P)

If L is a CFL then there exists a push down automata P accepting CFL L by empty stack i.e. L = N(P)

If L is a language accepted by PDA A by final state there exist a PDA B that accepts L by empty stack such that L =L(A) = N(B)

All of these

Discussion

MCQ

Push down automata accepts which language?

Context sensitive language

Context free language

Recursive language

None of the mentioned

Discussion

MCQ

A push down automata is different than finite automata by

Its memory (stack)

Number of states

Both (a) and (b)

None of these

Discussion

MCQ

If L1 is a context free language and L2 as a regular language, which of the following is/are False? a. L1-L2 is not context free b. L1 ? L2 is context free c. ~L1 is context free d. ~L2 is regular

Only b

Only c

Both a and c

Both b and c

Discussion

MCQ

Consider the following languages.

L₁ = {aⁱ b^j c^k | i = j, k ? 1}
L₁ = {aⁱ b^j | j = 2i, i ? 0}
Which of the following is true?

L1 is not a CFL but L2 is

	L1 ? L2 = ? and L1 is non-regular

	L1 ? L2 = ? and L1 is non-regular

There is a 4-state PDA that accepts L1, but there is no DPDA that accepts L2

Discussion

Banking

Engineering

General

Medical

Question Discussion & Solution

Report Error

Community Discussion

Similar Questions

Report Error

Report Error

Report Error

Report Error

Report Error

More Theory of Automata Topics

Reqular Expressions

Finite Automata

Context Free Grammars

Push Down Automata

Regular and context free languages

Pumping Lemma

Turning Machine

Banking

Engineering

General

Medical

Question Discussion & Solution

report Report Error

forum Community Discussion

auto_awesome Similar Questions

report Report Error

report Report Error

report Report Error

report Report Error

report Report Error

category More Theory of Automata Topics

Reqular Expressions

Finite Automata

Context Free Grammars

Push Down Automata

Regular and context free languages

Pumping Lemma

Turning Machine

Report Error

Community Discussion

Similar Questions

Report Error

Report Error

Report Error

Report Error

Report Error

More Theory of Automata Topics