Iterated deterministic substitution

@article{Asveld1977IteratedDS,
  title={Iterated deterministic substitution},
  author={Peter R. J. Asveld and Joost Engelfriet},
  journal={Acta Informatica},
  year={1977},
  volume={8},
  pages={285-302}
}
Deterministic substitution of languages means substituting the same word (from a given language) for all occurrences of a symbol. For an arbitrary family K of languages the notion of deterministic K-iteration grammar is introduced, which is essentially the iteration of a finite number of deterministic substitutions of languages from K. The families of languages generated by these grammars are investigated.