4352 search results - page 36 / 871 » A Representation Theorem and Applications |
TLCA
2009
Springer
14 years 5 months ago
2009
Springer
We show that, in a parametric model of polymorphism, the type ∀α.((α → α) → α) → (α → α → α) → α is isomorphic to closed n terms. That is, the type of closed ...
AMW
2010
14 years 6 days ago
2010
We provide a Myhill-Nerode-like theorem that characterizes the class of data languages recognized by deterministic finite-memory automata (DMA). As a byproduct of this characteriza...
IJCAI
1989
13 years 12 months ago
1989
In a recent paper, Ginsberg shows how a backward-chaining ATMS can be used to construct a theorem prover for circumscription. Here, this work is extended to handle prioritized cir...
IANDC
2008
13 years 10 months ago
2008
The problem of computing periods in words, or finite sequences of symbols from a finite alphabet, has important applications in several areas including data compression, string se...
ICIP
1997
IEEE
15 years 8 days ago
1997
IEEE
A new method termed the vertex representation is presented for approximating the shapes of objects of arbitrary dimensionality d (e.g., 20, 30, etc.) with orthogonal (d - 1)-dimen...