Sciweavers

60 search results - page 1 / 12
» An Effective Algorithm for the Membership Problem for Extend...
Sort
View
FOSSACS
2007
Springer
13 years 9 months ago
An Effective Algorithm for the Membership Problem for Extended Regular Expressions
By adding the complement operator (
Grigore Rosu
CORR
2010
Springer
139views Education» more  CORR 2010»
13 years 5 months ago
A proof Procedure for Testing Membership in Regular Expressions
We propose an algorithm that tests membership for regular expressions and show that the algorithm is correct. This algorithm is written in the style of a sequent proof system. The...
Keehang Kwon, Hong Pyo Ha, Jiseung Kim
PLANX
2008
13 years 6 months ago
Linear Time Membership for a Class of XML Types with Interleaving and Counting
Regular Expressions (REs) form the basis of most XML type languages, such as DTDs, XML Schema types, and XDuce types (Thompson et al. 2004; Hosoya and Pierce 2003). In this contex...
Giorgio Ghelli, Dario Colazzo, Carlo Sartiani
ICDE
2011
IEEE
263views Database» more  ICDE 2011»
12 years 9 months ago
Adding regular expressions to graph reachability and pattern queries
—It is increasingly common to find graphs in which edges bear different types, indicating a variety of relationships. For such graphs we propose a class of reachability queries ...
Wenfei Fan, Jianzhong Li, Shuai Ma, Nan Tang, Ying...
DLT
2009
13 years 3 months ago
Tight Bounds on the Descriptional Complexity of Regular Expressions
Abstract. We improve on some recent results on lower bounds for conversion problems for regular expressions. In particular we consider the conversion of planar deterministic finite...
Hermann Gruber, Markus Holzer