theory - Formally and Informally describe the language of this grammar -

theory - Formally and Informally describe the language of this grammar -

i have question help with:

formally , informally describe language of next grammar g = (Σ, n, s, p)

Σ = {a,b,c} n = {s,t,x} s = s p = { s->atxc, s->btc, t->atx, t->bt, txx->t, tc->*empty set*, txc-a> }

moreover, briefly , informally explain how grammar generates language.

hint: utilize |w|x notation describe language of grammar.

theory proof automata formal-languages