Finite-state techniques are widely used in various areas of Natural Language Processing (NLP). As Kaplan and Kay [12] have argular expressions are the appropriate level of abstract...
We study the expressiveness and performance of full-text search languages. Our main motivation is to provide a formal basis for comparing such languages and to develop a model for...
In this paper we introduce a notion of a regular expression over infinite alphabets and show that a language is definable by an infinite alphabet regular expression if and only if ...
We present further steps in our research into visual languages for animation. Animation is a rich mode of communication that is currently accessible to few, because animation syst...
In tandem with recent progress on computing on encrypted data via fully homomorphic encryption, we present a framework for computing on authenticated data via the notion of slight...
Jae Hyun Ahn, Dan Boneh, Jan Camenisch, Susan Hohe...