278 search results - page 14 / 56 » Enumerating Regular Expressions and Their Languages |
FPL
2008
Springer
13 years 9 months ago
2008
Springer
An approach is presented for high throughput matching of regular expressions (regexes) by first converting them into corresponding Non-deterministic Finite Automata (NFAs) which a...
ICDT
2003
ACM
14 years 21 days ago
2003
ACM
All the languages for querying semistructured data and the web use as an integral part regular expressions. Based on practical observations, finding the paths that satisfy those r...
ITICSE
2005
ACM
14 years 1 months ago
2005
ACM
FAdo1 is an ongoing project which aims the development of an interactive environment for symbolic manipulation of formal languages. In this paper we focus in the description of in...
SODA
2010
ACM
14 years 4 months ago
2010
ACM
Regular expression matching is a key task (and often computational bottleneck) in a variety of software tools and applications. For instance, the standard grep and sed utilities, ...
ICDE
2003
IEEE
14 years 8 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...