164 search results - page 21 / 33 » Rewriting Extended Regular Expressions |
100
click to vote
ICALP
2000
Springer
15 years 1 months ago
2000
Springer
Abstract. Tree-walking automata (TWAs) recently received new attention in the fields of formal languages and databases. Towards a better understanding of their expressiveness, we c...
CONCUR
2005
Springer
15 years 3 months ago
2005
Springer
Many decidability results are known for non-recursive cryptographic protocols, where the protocol steps can be expressed by simple rewriting rules. Recently, a tree transducer-base...
ICFP
2000
ACM
15 years 1 months ago
2000
ACM
We review the close relationship between abstract machines for (call-by-name or call-by-value) λ-calculi (extended with Felleisen’s C) and sequent calculus, reintroducing on the...
SIGMOD
2000
ACM
15 years 1 months ago
2000
ACM
We investigate the problem of using materialized views to answer SQL queries. We focus on modern decision-support queries, which involve joins, arithmetic operations and other (po...
CDC
2009
IEEE
15 years 2 months ago
2009
IEEE
— Since Witsenhausen put forward his remarkable counterexample in 1968, there have been many attempts to develop efficient methods for solving this non-convex functional optimiz...