Result Details
Fast Matching of Regular Patterns with Synchronizing Counting
Síč Juraj, Mgr., DITS (FIT)
Holíková Lenka, Ing., Ph.D., DITS (FIT)
Vojnar Tomáš, prof. Ing., Ph.D., DITS (FIT)
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).
regex, counting automata, synchronizing counting
@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"
}Efficient Finite Automata for Automated Reasoning, MŠMT, ERC CZ, LL1908, start: 2020-01-01, end: 2024-12-31, completed
Reliable, Secure, and Intelligent Computer Systems, BUT, Vnitřní projekty VUT, FIT-S-23-8151, start: 2023-03-01, end: 2026-02-28, running