219 search results - page 22 / 44 » Combinatorial Complexity of Regular Languages |
240
click to vote
ICDE
2003
IEEE
16 years 1 months ago
2003
IEEE
This paper presents SPEX, a streamed and progressive evaluation of regular path expressions with XPath-like qualifiers against XML streams. SPEX proceeds as follows. An expression...
125
click to vote
CORR
2008
Springer
15 years 13 days ago
2008
Springer
Classic algorithms for sequential pattern discovery, return all frequent sequences present in a database. Since, in general, only a few ones are interesting from a user's poin...
105
click to vote
APLAS
2006
ACM
15 years 6 months ago
2006
ACM
String expression analysis conservatively approximates the possible string values generated by a program. We consider the validation of a context-free grammar obtained by the analy...
ANLP
2000
15 years 1 months ago
2000
We compare the asymptotic time complexity of left-to-right and bidirectional parsing techniques for bilexical context-free grammars, a grammar formalis an abstraction of language ...
118
Voted
KBSE
1998
IEEE
15 years 4 months ago
1998
IEEE
We report on GADGET, a new software test generation system that uses combinatorial optimization to obtain condition/decision coverage of C/C++ programs. The GADGET system is fully...