205 search results - page 22 / 41 » Testing the Equivalence of Regular Languages |
PLILP
1997
Springer
15 years 4 months ago
1997
Springer
We introduce a framework for managing as a whole the space of a narrowing computation. The aim of our framework is to find a finite representation of an infinite narrowing space...
ACTA
2005
14 years 11 months ago
2005
It is known that LTL formulae without the `next' operator are invariant under the so-called stutter-equivalence of words. In this paper we extend this principle to general LTL...
104
click to vote
CORR
1999
Springer
14 years 11 months ago
1999
Springer
This paper proposes a Japanese/English crosslanguage information retrieval (CLIR) system targeting technical documents. Our system first translates a given query containing techni...
108
click to vote
NIPS
2003
15 years 1 months ago
2003
We describe a pattern acquisition algorithm that learns, in an unsupervised fashion, a streamlined representation of linguistic structures from a plain natural-language corpus. Th...
100
click to vote
PODS
1997
ACM
15 years 4 months ago
1997
ACM
We rework parts of the classical relational theory when the underlying domain is a structure with some interpreted operations that can be used in queries. We identify parts of the...