Question: Suppose A->xBz and B->y, then the simplified grammar would be:

Options

A : A->xyz

B : A->xBz|xyz

C : A->xBz|B|y

D : none of the mentioned

Click to view Correct Answer

Previous || Next

Autokey Cipher more questions

Given grammar G:^ S->aS|A|C^ A->a^ B->aa^ C->aCb^ Find the set....

Given Grammar: S->A, A->aA, A->e, B->bA^ Which among the following....

Given:^ S->?->xAy->?->w^ if __, then A is useful, else useless....

Given:^ S->aSb^ S->e^ S-> A^ A->aA^ B->C^ C->D^ The ratio....

In which of the following cipher the plain text and....

Vigenere cipher is harder to crack than autokey cipher.

What will be the ciphered text if the string ?SECRET?....

What will be the plain text corresponding to cipher text....

Which of the following correctly defines poly alphabetic cipher?

Which of the following is not a type of poly....

Affine Cipher more Online Exam Quiz

Graphics Devices - 1

2-3 Tree

AA Tree

Affine Cipher

Atbash Cipher

Design of Rotor - 2

Design Strength of Laterally Unsupported Beams - II

Introduction of Memory Devices - 4

Error Detection and Correction 2

Discrete-Time Processing of Continuous Time Signals