1445 search results - page 118 / 289 » Uniformly Hard Languages |
137
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Regular expressions (REs), because of their succinctness and clear syntax, are the common choice to represent regular languages. However, efficient pattern matching or word recogni...
117
click to vote
ENTCS
2008
15 years 4 months ago
2008
Lazy evaluation (or call-by-need) is widely used and well understood, partly thanks to a clear operational semantics given by Launchbury. However, modern non-strict functional lan...
132
click to vote
FUIN
2008
15 years 4 months ago
2008
Abstract. This work extends studies of Angluin, Lange and Zeugmann on how learnability of a language class depends on the hypothesis space used by the learner. While previous studi...
100
click to vote
BSL
2007
15 years 4 months ago
2007
We show how to interpret the language of first-order set theory in an elementary topos endowed with, as extra structure, a directed structural system of inclusions (dssi). As our ...
120
click to vote
ITA
2006
15 years 3 months ago
2006
In this work we study some probabilistic models for the random generation of words over a given alphabet used in the literature in connection with pattern statistics. Our goal is t...