A new algorithm is presented for testing if a regular language is locally threshold testable. The new algorithm is slower than existing algorithms, but its correctness proof is sh...
We give a universal kernel that renders all the regular languages linearly separable. We are not able to compute this kernel efficiently and conjecture that it is intractable, but...
Background: The advent of the technology of DNA microarrays constitutes an epochal change in the classification and discovery of different types of cancer because the information ...
This paper uses the locale theory approach to topology. Two descriptions are given of all locale limits, the first description using suplattice constructions and the second prefra...
Equational theories underly many elds of computing, including functional programming, symbolic algebra, theorem proving, term rewriting and constraint solving. In this paper we sh...
Mantis H. M. Cheng, Douglas Stott Parker Jr., Maar...