On the Complexity of String Folding

Mike Paterson, Teresa M. Przytycka. On the Complexity of String Folding. In Friedhelm Meyer auf der Heide, Burkhard Monien, editors, Automata, Languages and Programming, 23rd International Colloquium, ICALP96, Paderborn, Germany, 8-12 July 1996, Proceedings. Volume 1099 of Lecture Notes in Computer Science, pages 658-669, Springer, 1996.

@inproceedings{PatersonP96:0,
  title = {On the Complexity of String Folding},
  author = {Mike Paterson and Teresa M. Przytycka},
  year = {1996},
  researchr = {https://researchr.org/publication/PatersonP96%3A0},
  cites = {0},
  citedby = {0},
  pages = {658-669},
  booktitle = {Automata, Languages and Programming, 23rd International Colloquium, ICALP96, Paderborn, Germany, 8-12 July 1996, Proceedings},
  editor = {Friedhelm Meyer auf der Heide and Burkhard Monien},
  volume = {1099},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-61440-0},
}