762 search results - page 45 / 153 » Intercode Regular Languages |
116
Voted
LATA
2010
Springer
15 years 11 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...
134
click to vote
ACL
2001
15 years 3 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...
127
click to vote
LICS
2010
IEEE
15 years 7 days 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...
143
click to vote
DBPL
2005
Springer
15 years 7 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 ...
111
Voted
ICTCS
2005
Springer
15 years 7 months ago
2005
Springer
In the design of type systems for XML programming languages based on regular expression types and patterns the focus has been over result analysis, with the main aim of statically ...