1052 search results - page 79 / 211 » The Regular Real-Time Languages |
160
Voted
DATE
2008
IEEE
16 years 16 days ago
2008
IEEE
In many applications string pattern matching is one of the most intensive tasks in terms of computation time and memory accesses. Network Intrusion Detection Systems and DNA Seque...
158
click to vote
LATA
2010
Springer
16 years 3 months ago
2010
Springer
This paper presents a new polynomial-time algorithm for the inclusion problem for certain pairs of regular expressions. The algorithm is not based on construction of finite automat...
189
click to vote
ACL
2001
15 years 7 months ago
2001
Many machine learning methods have recently been applied to natural language processing tasks. Among them, the Winnow algorithm has been argued to be particularly suitable for NLP...
180
click to vote
LICS
2010
IEEE
15 years 4 months ago
2010
IEEE
We develop the theory of regular cost functions over finite trees: a quantitative extension to the notion of regular languages of trees: Cost functions map each input (tree) to a v...
189
Voted
DBPL
2005
Springer
15 years 11 months ago
2005
Springer
Pattern matching mechanisms based on regular expressions feature in a number of recent languages for processing XML. The flexibility of these mechanisms demands novel approaches ...