1 paper · 1 filter
Pierre Ganty, Elena Gutiérrez
Parikh's Theorem states that every context-free grammar (CFG) is equivalent to some regular CFG when the ordering of symbols in the words is ignored. The same is not true for the s…