278 search results - page 6 / 56 » Enumerating Regular Expressions and Their Languages |
CSL
2007
Springer
14 years 1 months ago
2007
Springer
We define regular expressions for unranked trees (actually, ordered sequences of unranked trees, called forests). These are compared to existing regular expressions for trees. On ...
DBPL
2007
Springer
14 years 1 months ago
2007
Springer
Martens et al. defined a pattern-based specification language equivalent in expressive power to the widely adopted XML Schema definitions (XSDs). This language consists of rules...
MST
2007
13 years 7 months ago
2007
Odometers or “adding machines” are usually introduced in the context of positional numeration systems built on a strictly increasing sequence of integers. We generalize this no...
ICFP
2004
ACM
14 years 7 months ago
2004
ACM
We extend Haskell with regular expression patterns. Regular expression patterns provide means for matching and extracting data which goes well beyond ordinary pattern matching as ...
ICALP
2004
Springer
14 years 25 days ago
2004
Springer
This paper studies the problem of matching sequences against regular expressions in order to produce structured values.