1147 search results - page 74 / 230 » Termination in language-based systems |
ICONIP
1998
13 years 11 months ago
1998
This paper describes a practical application of a novel terminal attractor algorithm to the construction of Perfect Hash Functions (PHF) for a prede ned set of keys. The proposed ...
FSTTCS
2008
Springer
13 years 11 months ago
2008
Springer
For a given (terminating) term rewriting system one can often estimate its derivational complexity indirectly by looking at the proof method that established termination. In this s...
TCS
2008
13 years 10 months ago
2008
In this paper, we present a fully automatizable approach to detecting loops in standard term rewriting. Our method is based on semi-unification and an unfolding operation which pr...
ICAI
2009
13 years 7 months ago
2009
- We describe a Web 3.0 interaction system where the mobile user scenario is combined with a touchscreenbased collaborative terminal. Multiple users should be able to easily organi...
ACSW
2003
13 years 11 months ago
2003
The nature of mobile communication, characterised for example by terminals having poor user interface and limited processing capacity, as well as complex combination of network pr...