I do not understand this question, please explain it in detail: Consider a langu

Question

I do not understand this question, please explain it in detail:

Consider a language of words, where each word is a string of ones and zeros.

The following grammar describes this language:

<word> = <token> | <word><token> | <word> <item>

<item> = 0

<token> = 1

(a) Derive all of the 3-character strings consisting of at least one 0.

(b) Derive one 7-character string that is made up of at least one 0 and one 1.

(c) Does the following string belong to this language? If not, show why not. If yes,show why.

0001101

Explanation / Answer

<word> = <token> | <word><token> | <word><item>

<item>= 0 <token>=1

so

<word> = 1 | <word> 1| <word> 0

a) 3 charcter strings of atleast one 0

001

010

100

b) one 7-character string made up of atleast one 0 and one 1

0000010

c) Yes 0001101 belongs to this laguage. It belongs to this language because it is a 7- character string containing atleast one 0 and one 1.

Related Questions

Navigate

• Browse (All)
• Browse I
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.