7773 search results - page 64 / 1555 » On generalized Frame-Stewart numbers |
COLING
2000
13 years 9 months ago
2000
We define state transition grammars (STG) as an intermediate tbrmalism between grammars and parsing algorithms which is intended to separate the description of a parsing strategy ...
JSYML
2008
13 years 7 months ago
2008
This article is devoted to two different generalizations of projective Boolean algebras: openly generated Boolean algebras and tightly -filtered Boolean algebras. We show that for ...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
This article studies the expressive power of finite automata recognizing sets of real numbers encoded in positional notation. We consider Muller automata as well as the restricted ...
SIAMCOMP
2008
13 years 7 months ago
2008
The Graph Theorem of classical recursion theory states that a total function on the natural numbers is computable, if and only if its graph is recursive. It is known that this res...
COLT
1993
Springer
13 years 11 months ago
1993
Springer
The Vapnik-Chervonenkis (V-C) dimension is an important combinatorial tool in the analysis of learning problems in the PAC framework. For polynomial learnability, we seek upper bou...