Pattern-Matching for Strings with Short Descriptions.
Combinatorial Pattern Matching (CPM 95),
Lecture Notes in Computer Science Vol.937, pp.205-214
(1995), [peer-reviewed]
Event Date:
July 5-7, 1995
Abstract / 概要
We consider strings which are succinctly described. The description is in terms of straight-line programs in which the constants are symbols and the only operation is the concatenation. Such descriptions correspond to the systems of recurrences or to context-free…