## Abstract

A run in a string is a nonextendable periodic substring in the string. Detecting all runs in a string is important and studied both from theoretical and practical points of view. In this paper, we consider the reverse problem of it. We reveal that the time complexity depends on the alphabet size k of the string to be output. We show that it is solvable in polynomial time for both binary alphabet and infinite alphabet, while it is NP-complete for finite k ≥ 4.We also consider a variant of the problem where only a subset of runs are given as an input. We show that it is solvable in polynomial time for infinite alphabet, while it is NP-complete for finite k ≥ 3.

Original language | English |
---|---|

Title of host publication | Proceedings of the Prague Stringology Conference 2010 |

Pages | 150-160 |

Number of pages | 11 |

Publication status | Published - 2010 Dec 1 |

Event | Prague Stringology Conference 2010, PSC 2010 - Prague, Czech Republic Duration: 2010 Aug 30 → 2010 Sep 1 |

### Other

Other | Prague Stringology Conference 2010, PSC 2010 |
---|---|

Country/Territory | Czech Republic |

City | Prague |

Period | 10/8/30 → 10/9/1 |

## Keywords

- Inferring problem
- Repetition
- Runs

## ASJC Scopus subject areas

- Mathematics(all)