This paper combines predictive labeling with dependency pairs and reports on its implementation. Our starting point is the method of proving termination of rewrite systems using se...
Abstract. We introduce an approach to designing filtering algorithms by derivation from finite automata operating on constraint signatures. We illustrate this approach in two cas...
We present new and more efficient algorithms for regular language enumeration problems. The min-word problem is to find the lexicographically minimal word of length n accepted by ...
To any infinite word t over a finite alphabet A we can associate two infinite words min(t) and max(t) such that any prefix of min(t) (resp. max(t)) is the lexicographically smalle...
Cross-language document retrieval systems require support by some kind of multilingual thesaurus for semantically indexing documents in different languages. The peculiarities of t...