1413 search results - page 58 / 283 » Bisimilarity of Open Terms |
RTA
2007
Springer
15 years 7 months ago
2007
Springer
The use of automata techniques to prove the termination of string rewrite systems and left-linear term rewrite systems is advocated by Geser et al. in a recent sequence of papers. ...
101
click to vote
FOCM
2008
15 years 26 days ago
2008
Let Fq be the finite field of q elements, where q = ph. Let f(x) be a polynomial over Fq in n variables with m non-zero terms. Let N(f) denote the number of solutions of f(x) = 0 ...
105
click to vote
EICS
2009
ACM
15 years 7 months ago
2009
ACM
The Open Interface Development Environment (OIDE) was developed as part of the OpenInterface (OI) platform, an open source framework for the rapid development of multimodal intera...
IMC
2006
ACM
15 years 6 months ago
2006
ACM
Peer-to-peer (P2P) networks continue to be popular means of trading content. However, very little protection is in place to make sure that the files exchanged in these networks a...
118
Voted
SOFSEM
2010
Springer
15 years 9 months ago
2010
Springer
We present a new technique to prove termination of Term Rewriting Systems, with full automation. A crucial task in this context is to find suitable well-founded orderings. A popul...