English

A Note on Nested String Replacements

Formal Languages and Automata Theory 2016-07-08 v1

Abstract

We investigate the number of nested string replacements required to reduce a string of identical characters to one character.

Keywords

Cite

@article{arxiv.1607.01828,
  title  = {A Note on Nested String Replacements},
  author = {Holger Petersen},
  journal= {arXiv preprint arXiv:1607.01828},
  year   = {2016}
}
R2 v1 2026-06-22T14:47:41.328Z