164 search results - page 16 / 33 » Quotient Complexity of Regular Languages |
112
Voted
PODS
2007
ACM
16 years 2 months ago
2007
ACM
In a recent paper, Martens et al. introduced a specification mechanism for XML tree languages, based on rules of the form r s, where r, s are regular expressions. Sets of such ru...
107
Voted
VL
2006
IEEE
15 years 7 months ago
2006
IEEE
To explore how people conceptualize a complex system, 232 university students were asked to sketch how a search engine works. While the sketches reveal a diverse range of visual a...
121
Voted
CHARME
2005
Springer
15 years 7 months ago
2005
Springer
The application of model-checking tools to complex systems involves a nontrivial step of modelling the system by a finite-state model and a translation of the desired properties i...
106
click to vote
ACL
2007
15 years 3 months ago
2007
Dependency-based representations of natural language syntax require a fine balance between structural flexibility and computational complexity. In previous work, several constra...
147
Voted
SODA
2010
ACM
15 years 11 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, ...