Work

Efficient Regex Matching with Sparse Counting-Sets

Year: 2026

Type: article

Abstract: Regular expressions with counting operations (c-regexes) offer a compact representation of repeating patterns by allowing numerical bounds to be added to subexpressions. Recent work introduced the counting-set data structure, which allows simultaneous updates of multiple counter values for efficient matching. However, this approach suffers from a performance bottleneck when counting-sets must be replicated due to the presence of branching transitions. We propose a sparse counting-set approach, which reduces the replication overhead by maintaining only essential counter values, thereby yielding a more efficient matching algorithm.

Source: Electronic Proceedings in Theoretical Computer Science

DOI: 10.4204/eptcs.446.2

Authors: Martin Berglund, Brink van der Merwe, Sicheol Sung

Institutions: Umeå University, Stellenbosch University, Yonsei University

Language: English

Topic: Algorithms and Data Compression

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: diamond

OpenAlex ID: W7166293637

FWCI:

Cites:

Cited by:

Related to: