grammer: G=(sigma, delta, S, pi)

where: sigma={0,1,lamda}, delta={S,X,Y,Z} and

pi={S-->0X|1Y, X-->1Y|1Z, Y-->0X|0Z, Z-->0}

We're a place where learners ask for help for their tasks and share their knowledge.

grammer: G=(sigma, delta, S, pi)

where: sigma={0,1,lamda}, delta={S,X,Y,Z} and

pi={S-->0X|1Y, X-->1Y|1Z, Y-->0X|0Z, Z-->0}

For further actions, you may consider blocking this person and/or reporting abuse

Kingoflions -

alexyz -

WiiMan -

Joel Logan -

Joel Logan -

Grace J -

Tam -

Jay™ -

EMMAXDOLL -

Memyselfandi -

gbbg123 -

FunkSoulBrother -

909_ -

Beth Ross -

Jack T -

ben -

Love Blind -

sarboo3 -

Love Blind -

Love Blind -

## Answers (1)

Not sure what you are asking. The grammar IS a description of the language. Or, did you need to construct some automaton that accepts this language? Look into Z. Manna's "Mathematical theory of computation."