Theoretical computer science
Posts  1 - 1  of  1
HalloTN
hallo
1G = ({S, A,B}, {a, i,m, o, p},
{S - AB,A- om,A-op,B-a,B-i}, S)

2G = ({S, A,B}, {a, g, n, u},
{S - AA, S -BB,A- na,AA- Anu,B - ga,BB - Bgu}, S)

3G = ({S, A,B,C}, {a, b},
{S -ASA, S - C,ACAA - BC,C - ǫ,B - b,A - a}, S)


what language build this Grammatik
in the form of
LG{a^n,m^n,p^n,i^n|n>1}
please i neeed help :( :(
Save
Cancel
Reply
 
x
OK