Finding overlaps within regular expressions with variable-length gaps

  • Authors:

  • Juan Mendivelso;Yoan Pinzón;Inbok Lee

  • Affiliations:

  • Universidad Nacional de Colombia Avenida Carrera, Ciudad Universitaria Bogotá, Colombia;Universidad Nacional de Colombia Avenida Carrera, Ciudad Universitaria Bogotá, Colombia;Korea Aerospace University, Goyang City, Republic of Korea

  • Venue:
  • Proceedings of the 2013 Research in Adaptive and Convergent Systems
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

Regular expressions play an important role in various fields in computer science. However, handling many regular expressions in parallel requires huge computation resources. Therefore, it is necessary to find and eliminate overlapping regular expressions. In this paper, we consider a special type of regular expressions: expressions comprised of characters and variable-length gaps between such characters. Specifically, we propose a bit-parallel solution to determine whether the languages of two expressions X and Y with variable-length gaps have a common string. The time complexity of our algorithm is O (min (LX 2|Σ|, LX LY)/w) where Σ is the alphabet from which X and Y are drawn, LX and LY are the lengths of the longest strings that respectively match X and Y, and w is the size of the computer word.