Database Paper Browser

Back to papers

Deterministic Regular Expressions in Linear Time

Summary: Linear-time O(|e|) algorithm to test whether a regular expression e is deterministic, improving the prior O(σ|e|) Glushkov-based bound via a novel structural decomposition of e's parse tree. Combined matching in O(|e|+|w|) for star-free, bounded-occurrence, and bounded plus-depth deterministic REs, and O(|e|+|w| log log |e|) for arbitrary deterministic REs. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1564
Venue
PODS
Year
2012
Pagerank
4.1945683e-05
Overall Rank
12,102 | 15.81%
DOI
-

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 1 of 1 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
1,356 Validating Streaming XML Documents 2002 PODS 0.0001239231
Previous Page 1 / 1 Next

Semantically Similar Papers