Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/589
Title: Complexity of Decision Problems for Simple Regular Expressions.
Authors: MARTENS, Wim 
NEVEN, Frank 
Schwentick, Thomas
Issue Date: 2004
Publisher: Springer
Source: MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2004, PROCEEDINGS. p. 889-900
Series/Report: LECTURE NOTES IN COMPUTER SCIENCE
Series/Report no.: 3153
Abstract: We study the complexity of the inclusion, equivalence, and intersection problem for simple regular expressions arising in practical XML schemas. These basically consist of the concatenation of factors where each factor is a disjunction of strings possibly extended with ‘*’ or ‘?’. We obtain lower and upper bounds for various fragments of simple regular expressions. Although we show that inclusion and intersection are already intractable for very weak expressions, we also identify some tractable cases. For equivalence, we only prove an initial tractability result leaving the complexity of more general cases open. The main motivation for this research comes from database theory, or more specifically XML and semi-structured data.We namely show that all lower and upper bounds for inclusion and equivalence, carry over to the corresponding decision problems for extended context-free grammars and single-type tree grammars, which are abstractions of DTDs and XML Schemas, respectively.For intersection, we show that the complexity only carries over for DTDs.
Document URI: http://hdl.handle.net/1942/589
ISSN: 0302-9743
DOI: 10.1007/b99679
ISI #: 000223615400070
Category: A1
Type: Journal Contribution
Validations: ecoom 2005
Appears in Collections:Research publications

Files in This Item:
File Description SizeFormat 
35neven.pdf146.3 kBAdobe PDFView/Open
Show full item record

WEB OF SCIENCETM
Citations

26
checked on May 21, 2022

Page view(s)

88
checked on May 25, 2022

Download(s)

188
checked on May 25, 2022

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.