644 search results - page 85 / 129 » Precedence Automata and Languages |
192
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...
198
Voted
PAAMS
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. Regular expressions, or simply regex, have been widely used as a powerful pattern matching and text extractor tool through decades. Although they provide a powerful and f...
163
click to vote
ICFP
2004
ACM
16 years 6 months ago
2004
ACM
We present a process logic for the -calculus with the linear/affine type discipline (Berger et al. 2001; Berger et al. 2003; Honda and Yoshida 2002; Honda and Yoshida 2003; Honda ...
204
Voted
CASCON
2003
15 years 8 months ago
2003
Any attempt at automated software analysis or modification must be preceded by a comprehension step, i.e. parsing. This task, while often considered straightforward, can in fact ...
188
click to vote
FSTTCS
2004
Springer
16 years 2 days ago
2004
Springer
The class of visibly pushdown languages has been recently defined as a subclass of context-free languages with desirable closure properties and tractable decision problems. We stu...