𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the complexity of the string generation problem

✍ Scribed by Okhotin, A. S.

Book ID
120137493
Publisher
Walter de Gruyter GmbH & Co. KG
Year
2003
Tongue
English
Weight
146 KB
Volume
13
Category
Article
ISSN
0924-9265

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the Comparison Complexity of the Stri
On the Comparison Complexity of the String Prefix-Matching Problem
✍ Dany Breslauer; Livio Colussi; Laura Toniolo πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 525 KB

In this paper we study the exact comparison complexity of the string prefixmatching problem in the deterministic sequential comparison model with equality tests. We derive almost tight lower and upper bounds on the number of symbol comparisons required in the worst case by on-line prefix-matching al

On the complexity of string folding
On the complexity of string folding
✍ Mike Paterson; Teresa Przytycka πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 1001 KB

A fold of a finite string S over a given alphabet is an embedding of S in some fixed infinite grid, such as the square or cubic mesh. The score of a fold is the number of pairs of matching string symbols which are embedded at adjacent grid vertices. Folds of strings in two-and threedimensional meshe