219 search results - page 19 / 44 » Combinatorial Complexity of Regular Languages |
80
Voted
COGSCI
2011
14 years 7 months ago
2011
This paper examines whether adults can adapt to novel accents of their native language that contain unfamiliar context-dependent phonological alternations. In two experiments, Fre...
121
Voted
AAAI
2007
15 years 2 months ago
2007
Expressive Description Logics (DLs) have been advocated as formalisms for modeling the domain of interest in various application areas. An important requirement is the ability to ...
104
click to vote
PLDI
2004
ACM
15 years 5 months ago
2004
ACM
Regular path queries are a way of declaratively expressing queries on graphs as regular-expression-like patterns that are matched against paths in the graph. There are two kinds o...
TON
2012
13 years 2 months ago
2012
—Regular expressions (RegExes) are widely used, yet their inherent complexity often limits the total number of RegExes that can be detected using a single chip for a reasonable t...
185
click to vote
ICDT
2009
ACM
16 years 1 months ago
2009
ACM
The inclusion of Regular Expressions (REs) is the kernel of any type-checking algorithm for XML manipulation languages. XML applications would benefit from the extension of REs wi...