159 search results - page 13 / 32 » Soft lambda-Calculus: A Language for Polynomial Time Computa... |
92
Voted
ITA
2007
14 years 11 months ago
2007
We study the problem of learning regular tree languages from text. We show that the framework of function distinguishability as introduced by the author in Theoretical Computer Sc...
FUIN
2007
14 years 11 months ago
2007
Intercodes are a generalization of comma-free codes. Using the structural properties of finite-state automata recognizing an intercode we develop a polynomial-time algorithm for d...
105
click to vote
ICTAC
2009
Springer
14 years 9 months ago
2009
Springer
Online trading invariably involves dealings between strangers, so it is important for one party to be able to judge objectively the trustworthiness of the other. In such a setting,...
107
click to vote
ALT
1995
Springer
15 years 3 months ago
1995
Springer
This paper characterizes the polynomial time learnability of TPk, the class of collections of at most k rst-order terms. A collection in TPk de nes the union of the languages de n...
94
Voted
ISAAC
2003
Springer
15 years 4 months ago
2003
Springer
Given a string x and a language L, the Hamming distance of x to L is the minimum Hamming distance of x to any string in L. The edit distance of a string to a language is analogous...