On the public citation graph

Regex matching with counting-set automata

https://doi.org/10.1145/3428286
0 signed · 57 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1006/inco.1997.2695openalex-snapshot
One-Unambiguous Regular Languages
inferredcites →https://doi.org/10.1007/11821069_10openalex-snapshot
A Unified Construction of the Glushkov, Follow, and Antimirov Automata
inferredcites →https://doi.org/10.1007/11965893_19openalex-snapshot
Optimizing Schema Languages for XML: Numerical Constraints and Interleaving
inferredcites →https://doi.org/10.1007/3-540-48194-x_15openalex-snapshot
Computing the Equation Automaton of a Regular Expression in O(s 2) Space and Time
inferredcites →https://doi.org/10.1007/978-3-030-17462-0_24openalex-snapshot
Symbolic Regex Matcher
inferredcites →https://doi.org/10.1007/978-3-540-85361-9_9openalex-snapshot
R-Automata
inferredcites →https://doi.org/10.1007/978-3-540-89862-7_15openalex-snapshot
Fast Signature Matching Using Extended Finite Automaton (XFA)
inferredcites →https://doi.org/10.1007/978-3-642-03466-4_15openalex-snapshot
Regular Expressions with Numerical Constraints and Automata with Counters
inferredcites →https://doi.org/10.1007/978-3-642-15512-3_4openalex-snapshot
Improving NFA-Based Signature Matching Using Ordered Binary Decision Diagrams
inferredcites →https://doi.org/10.1007/978-3-642-21254-3_13openalex-snapshot
Partial Derivatives of an Extended Regular Expression
inferredcites →https://doi.org/10.1007/978-3-642-28332-1_27openalex-snapshot
The Membership Problem for Regular Expressions with Unordered Concatenation and Numerical Constraints
inferredcites →https://doi.org/10.1007/bfb0028752openalex-snapshot
A comparison of Presburger engines for EFSM reachability
inferredcites →https://doi.org/10.1007/s10009-008-0064-3openalex-snapshot
FAST: acceleration from theory to practice
inferredcites →https://doi.org/10.1016/0304-3975(86)90088-5openalex-snapshot
From regular expressions to deterministic automata
inferredcites →https://doi.org/10.1016/0304-3975(95)00104-2openalex-snapshot
Local languages and the Berry-Sethi algorithm
inferredcites →https://doi.org/10.1016/0304-3975(95)00182-4openalex-snapshot
Partial derivatives of regular expressions and finite automaton constructions
inferredcites →https://doi.org/10.1016/j.ic.2006.12.003openalex-snapshot
One-unambiguity of regular expressions with numeric occurrence indicators
inferredcites →https://doi.org/10.1016/j.ic.2014.12.001openalex-snapshot
Checking determinism of regular expressions with counting
inferredcites →https://doi.org/10.1016/j.tcs.2004.10.016openalex-snapshot
Derivatives of rational expressions with multiplicity
inferredcites →https://doi.org/10.1016/s0890-5401(03)00090-7openalex-snapshot
Follow automata
inferredcites →https://doi.org/10.1017/s0956796808007090openalex-snapshot
Regular-expression derivatives re-examined
inferredcites →https://doi.org/10.1070/rm1961v016n05abeh004112openalex-snapshot
THE ABSTRACT THEORY OF AUTOMATA
inferredcites →https://doi.org/10.1109/icst.2010.15openalex-snapshot
Rex: Symbolic Regular Expression Explorer
inferredcites →https://doi.org/10.1109/sp.2008.14openalex-snapshot
XFA: Faster Signature Matching with Extended Automata
inferredcites →https://doi.org/10.1137/100814196openalex-snapshot
Regular Expressions with Counting: Weak versus Strong Determinism
inferredcites →https://doi.org/10.1145/157485.164585openalex-snapshot
Automatic functional test generation using the extended finite state machine model
inferredcites →https://doi.org/10.1145/1863543.1863594openalex-snapshot
A play on regular expressions
inferredcites →https://doi.org/10.1145/230514.571645openalex-snapshot
Introduction to the Theory of Computation
inferredcites →https://doi.org/10.1145/2806416.2806434openalex-snapshot
Efficient Incremental Evaluation of Succinct Regular Expressions
inferredcites →https://doi.org/10.1145/321239.321249openalex-snapshot
Derivatives of Regular Expressions
inferredcites →https://doi.org/10.1145/3236024.3236027openalex-snapshot
The impact of regular expression denial of service (ReDoS) in practice: an empirical study at the ecosystem scale
inferredcites →https://doi.org/10.1145/3338906.3338909openalex-snapshot
Why aren’t regular expressions a lingua franca? an empirical study on the re-use and portability of regular expressions
inferredcites →https://doi.org/10.1145/3338906.3342509openalex-snapshot
Rethinking Regex engines to address ReDoS
inferredcites →https://doi.org/10.1145/359842.359859openalex-snapshot
A fast string searching algorithm
inferredcites →https://doi.org/10.1145/363347.363387openalex-snapshot
Programming Techniques: Regular expression search algorithm

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-031-25312-6_27openalex-snapshot
Automata with Bounded Repetition in RE2
inferred← citeshttps://doi.org/10.1007/978-3-031-30829-1_19openalex-snapshot
Fast Matching of Regular Patterns with Synchronizing Counting
inferred← citeshttps://doi.org/10.1007/978-3-031-65627-9_3openalex-snapshot
Algebraic Reasoning Meets Automata in Solving Linear Integer Arithmetic
inferred← citeshttps://doi.org/10.1007/978-3-031-74234-7_8openalex-snapshot
Efficient Offline Monitoring for Dynamic Metric Temporal Logic
inferred← citeshttps://doi.org/10.1007/978-981-96-0602-3_7openalex-snapshot
Enhancing Multi-modal Regular Expression Synthesis via Large Language Models and Semantic Manipulations of Sub-expressions
inferred← citeshttps://doi.org/10.1007/978-981-99-8664-4_1openalex-snapshot
String Constraints with Regex-Counting and String-Length Solved More Efficiently
inferred← citeshttps://doi.org/10.1016/j.sysarc.2025.103340openalex-snapshot
An efficient string solver for string constraints with regex-counting and string-length
inferred← citeshttps://doi.org/10.1016/j.sysarc.2026.103762openalex-snapshot
Multi-modal regular expression synthesis method based on large language models and semantics
inferred← citeshttps://doi.org/10.1109/access.2026.3725911openalex-snapshot
ZDPI: Zero-Copy Deep Packet Inspection via Compressed Finite State Automata in eBPF/XDP With BPF Arena
inferred← citeshttps://doi.org/10.1109/cgo57630.2024.10444810openalex-snapshot
One Automaton to Rule Them All: Beyond Multiple Regular Expressions Execution
inferred← citeshttps://doi.org/10.1109/sp46215.2023.10179328openalex-snapshot
Effective ReDoS Detection by Principled Vulnerability Modeling and Exploit Generation
inferred← citeshttps://doi.org/10.1109/sp46215.2023.10179442openalex-snapshot
Improving Developers’ Understanding of Regex Denial of Service Tools through Anti-Patterns and Fix Strategies
inferred← citeshttps://doi.org/10.1145/3510003.3510047openalex-snapshot
Exploiting input sanitization for regex denial of service
inferred← citeshttps://doi.org/10.1145/3519939.3523456openalex-snapshot
Software-hardware codesign for efficient in-memory regular pattern matching
inferred← citeshttps://doi.org/10.1145/3586044openalex-snapshot
Regular Expression Matching using Bit Vector Automata
inferred← citeshttps://doi.org/10.1145/3591262openalex-snapshot
Derivative Based Nonbacktracking Real-World Regex Matching with Backtracking Semantics
inferred← citeshttps://doi.org/10.1145/3620665.3640412openalex-snapshot
BVAP: Energy and Memory Efficient Automata Processing for Regular Expressions with Bounded Repetitions
inferred← citeshttps://doi.org/10.1145/3656431openalex-snapshot
Linear Matching of JavaScript Regular Expressions
inferred← citeshttps://doi.org/10.1145/3704837openalex-snapshot
RE#: High Performance Derivative-Based Regex Matching with Intersection, Complement, and Restricted Lookarounds
inferred← citeshttps://doi.org/10.1145/3708821.3733912openalex-snapshot
SoK: A Literature and Engineering Review of Regular Expression Denial of Service (ReDoS)
inferred← citeshttps://doi.org/10.1145/3774651openalex-snapshot
On-Demand Regular Expression Matching on FPGAs for Efficient Deep Packet Inspection
inferred← citeshttps://doi.org/10.1145/3808281openalex-snapshot
Towards Efficient Matching of Regexes with Backreferences using Register Set Automata
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.