3653 search results - page 274 / 731 » On Recognizable Timed Languages |
191
click to vote
ISAAC
2003
Springer
16 years 14 days 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...
223
click to vote
NAACL
1994
15 years 8 months ago
1994
The Workshop included an extended group of presentations by selected US government agencies and an invited guest from the European Community. These presentations, amplified in the...
209
click to vote
HASKELL
2008
ACM
15 years 8 months ago
2008
ACM
We present Haskell libraries that statically ensure the safe use of resources such as file handles. We statically prevent accessing an already closed handle or forgetting to clos...
190
click to vote
CL
2010
Springer
15 years 7 months ago
2010
Springer
In a modern programming language, scoping rules determine the visibility of names in various regions of a program [15]. In this work, we examine the idea of allowing an applicatio...
241
click to vote
SCP
1998
15 years 7 months ago
1998
A central challenge in computer science and knowledge representation is the integration of conceptual frameworks for continuous and discrete change, as exemplified by the theory ...