210 search results - page 18 / 42 » Uniform regular enumerations |
108
click to vote
ICALP
2001
Springer
15 years 6 months ago
2001
Springer
We consider the set Gn of all period sets of strings of length n over a finite alphabet. We show that there is redundancy in period sets and introduce the notion of an irreducibl...
116
click to vote
AIIA
1999
Springer
15 years 6 months ago
1999
Springer
In this paper we show how to extend KEM, a tableau-like proof system for normal modal logic, in order to deal with classes of non-normal modal logics, such as monotonic and regular...
DCC
2001
IEEE
16 years 1 months ago
2001
IEEE
A method for demonstrating and enumerating uniformly efficient (permutation-optimal) trellis decoders for self-dual codes of high minimum distance is developed. Such decoders and c...
103
click to vote
COLT
2001
Springer
15 years 6 months ago
2001
Springer
A class C of recursive functions is called robustly learnable in the sense I (where I is any success criterion of learning) if not only C itself but even all transformed classes ...
116
click to vote
PLILP
1997
Springer
15 years 5 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...