Simon's congruence pattern matching

The Simon's congruence problem is to determine whether or not two strings have the same set of subsequences of length no greater than a given integer, and the problem can be answered in linear time. We consider the Simon's congruence pattern matching problem that looks for all substrings o...

Full description

Saved in:
Bibliographic Details
Published in:Theoretical computer science Vol. 994; p. 114478
Main Authors: Kim, Sungmin, Ko, Sang-Ki, Han, Yo-Sub
Format: Journal Article
Language:English
Published: Elsevier B.V 01.05.2024
Subjects:
ISSN:0304-3975, 1879-2294
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Be the first to leave a comment!
You must be logged in first