Publication Details

Fast Matching of Regular Patterns with Synchronizing Counting

HOLÍK, L.; HOLÍKOVÁ, L.; SÍČ, J.; VOJNAR, T. Fast Matching of Regular Patterns with Synchronizing Counting. In Foundations of Software Science and Computation Structures. Lecture Notes in Computer Science. Heidelberg: Springer Verlag, 2023. p. 392-412. ISSN: 0302-9743.
Czech title
Rychlé porovnávání regulárních vzorů se synchronizovaným počítáním
Type
conference paper
Language
English
Authors
URL
Keywords

regex, counting automata, synchronizing counting

Abstract

Fast matching of regular expressions with bounded repetition, aka counting, such as (){,}, i.e., matching linear in the length of the text and independent of the repetition bounds, has been an open problem for at least two decades. We show that, for a wide class of regular expressions with counting, which we call synchronizing, fast matching is possible. We empirically show that the class covers nearly all counting used in usual applications of regex matching. This complexity result is based on an improvement and analysis of a recent matching algorithm that compiles regexes to deterministic counting-set automata (automata with registers that hold sets of numbers).

Published
2023
Pages
392–412
Journal
Lecture Notes in Computer Science, vol. 13992, no. 1, ISSN 0302-9743
Proceedings
Foundations of Software Science and Computation Structures
Publisher
Springer Verlag
Place
Heidelberg
DOI
EID Scopus
BibTeX
@inproceedings{BUT185169,
  author="Lukáš {Holík} and Juraj {Síč} and Lenka {Holíková} and Tomáš {Vojnar}",
  title="Fast Matching of Regular Patterns with Synchronizing Counting",
  booktitle="Foundations of Software Science and Computation Structures",
  year="2023",
  journal="Lecture Notes in Computer Science",
  volume="13992",
  number="1",
  pages="392--412",
  publisher="Springer Verlag",
  address="Heidelberg",
  doi="10.1007/978-3-031-30829-1\{_}19",
  issn="0302-9743",
  url="https://link.springer.com/chapter/10.1007/978-3-031-30829-1_19"
}
Files
Back to top