164 search results - page 17 / 33 » Quotient Complexity of Regular Languages |
261
Voted
ICDE
2003
IEEE
16 years 3 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...
144
click to vote
CORR
2008
Springer
15 years 1 months 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...
117
Voted
APLAS
2006
ACM
15 years 7 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...
104
Voted
ANLP
2000
15 years 3 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 ...
106
click to vote
CSR
2006
Springer
15 years 5 months ago
2006
Springer
Zielonka's theorem shows that each regular set of Mazurkiewicz traces can be implemented as a system of synchronized processes provided with some distributed control structure...