513 search results - page 22 / 103 » Finitely Based, Finite Sets of Words |
BPM
2008
Springer
13 years 10 months ago
2008
Springer
We present a finite representation of all services M where the composition with a given service N is deadlock-free, and a given set of activities of N can be covered (i.e. is not d...
CIE
2008
Springer
13 years 10 months ago
2008
Springer
We study perfectly locally computable structures, which are (possibly uncountable) structures S that have highly effective presentations of their local properties. We show that eve...
CLEIEJ
2008
13 years 8 months ago
2008
A lot of material has been written about wavelet theory. Most of these texts provide an elegant framework from the functional and real analysis point of view. The complete infinit...
IJAC
2008
13 years 8 months ago
2008
Abstract. A regular set of words is (k-)locally testable if membership of a word in the set is determined by the nature of its subwords of some bounded length k. In this article we...
ACL
1998
13 years 9 months ago
1998
We present a method for constructing, maintaining and consulting a database of proper nouns. We describe noun phrases composed of a proper noun and/or a description of a human occ...