We propose an algorithm that tests membership for regular expressions and show that the algorithm is correct. This algorithm is written in the style of a sequent proof system. The...
Information retrieval tools and search engines have mainly been leveraging research results and technologies developed for the English language. In this paper we report the issues...
We employ Automorphology, an MDL-based algorithm that determines the suffixes present in a language-sample with no prior knowledge of the language in question, and describe our exp...
John A. Goldsmith, Derrick Higgins, Svetlana Sogla...
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
We describe the design and implementation of the Glue-Nail database system. The Nail language is a purely declarative query language; Glue is a procedural language used for nonque...
Marcia A. Derr, Shinichi Morishita, Geoffrey Phipp...