computation theory - Grammar for a^n -
currently studying computation theory , came t - f question :
the following grammar
s -> | sa produces language {a^n | n>=1}.
well not know if can that, because grammar not halt. creates bunch accept nothing. surely if had ε derivation rule.
it same having following:

that never comes final state.
Comments
Post a Comment