If P & R are regular and also given that if PQ=R, then?...

MCQ

If P & R are regular and also given that if PQ=R, then?

Q has to be regular

Q cannot be regular

Q need not be regular

Q has to be a CFL

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

MCQ

Consider a CFG with the following productions. S ? AA | B A ? 0A | A0 | 1 B ? 0B00 | 1 S is the start symbol, A and B are non-terminals and 0 and 1 are the terminals. The language generated by this grammar is

{0ⁿ 10²ⁿ | n ? 1}

{0ⁱ 10^j 10^k | i, j, k ? 0} ? {0ⁿ 10²ⁿ | n ? l}

{0ⁱ 10^j | i, j ? 0} ? {0ⁿ 10²ⁿ | n ? l}

The set of all strings over {0, 1} containing at least two 0's

None of the above

Discussion

MCQ

A CFG G is given with the following productions where S is the start symbol, A is a non-terminal and a and b are terminals.
S?aS?A
A?aAb?bAa??
Which of the following strings is generated by the grammar above?

aabbaba

aabaaba

abababb

aabbaab

Discussion

MCQ

The minimum state automaton equivalent to the below FSA has the following number of states---

Discussion

MCQ

Which of the following statement is false?

In derivation tree, the label of each leaf node is terminal

In derivation tree, the label of all nodes except leaf nodes is a variable

In derivation tree, if the root of a sub tree is X then it is called

None of the mentioned

Discussion

MCQ

Which of the following statement is correct?

All Regular grammar are context free but not vice versa

All context free grammar are regular grammar but not vice versa

Regular grammar and context free grammar are the same entity

None of the mentioned

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