A Note on Nested String Replacements
classification
💻 cs.FL
keywords
stringnestedreplacementscharactercharactersidenticalinvestigatenote
read the original abstract
We investigate the number of nested string replacements required to reduce a string of identical characters to one character.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.