Unrestricted Grammar to generate grammar which generates $\{a^1#a^2#a^3#...#a^k} a^1\#a^2\#a^3\#\dots \#a^k \mid k >0 \}$

Can anyone provide with aI am looking for an unrestricted grammar to generatewhich generates the following stringlanguage:

{a^1#a^2#a^3#...#a^k} k >0$\{ a^1\#a^2\#a^3\# \dots \#a^k \mid k >0 \}$

thatThat is, words like {a#aa#aaa#aaaa#...$a\#aa\#aaa\#aaaa\# \dots \# \text{$k$ times '$a$'}$.#k times 'a'}

Source Link

asked Dec 2, 2018 at 18:23

Unrestricted Grammar to generate {a^1#a^2#a^3#...#a^k} k >0

Can anyone provide with a grammar to generate the following string

{a^1#a^2#a^3#...#a^k} k >0

that is {a#aa#aaa#aaaa#....#k times 'a'}