SIGN IN
SIGN UP
Deterministic regular expressions in linear time
Full Text:
PDF
Buy this Article
Authors:
Benotît Groz
INRIA and University of Lille, Lille, France
Sebastian Maneth
NICTA and UNSW, Sydney, Australia
Slawek Staworko
INRIA and University of Lille, Lille, France
Published in:
· Proceeding
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
Pages 49-60
ACM
New York, NY
, USA
©2012
table of contents
ISBN: 978-1-4503-1248-6
doi>
10.1145/2213556.2213566
2012 Article
Bibliometrics
· Downloads (6 Weeks): 29
· Downloads (12 Months): 210
· Downloads (cumulative): 210
· Citation Count: 1
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
SIGMOD/PODS'13
Share:
|
Tags:
algorithms
computations on discrete structures
deterministic regular expression
dtd
glushkov automaton
linear time
simplification of expressions
xml schema
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder