400 search results - page 32 / 80 » Rational stochastic languages |
CCL
1994
Springer
13 years 11 months ago
1994
Springer
We employ the model-theoretic method of Ehrenfeucht-Fra sse Games to prove the completeness of the theory CFT, which has been introduced in 22] for describing rational trees in a ...
CIE
2006
Springer
13 years 11 months ago
2006
Springer
We prove constructively (in the style of Bishop) that every monotone continuous function with a uniform modulus of increase has a continuous inverse. The proof is formalized, and a...
ICGI
1998
Springer
13 years 12 months ago
1998
Springer
This paper describes a new sampling-based heuristic for tree search named SAGE and presents an analysis of its performance on the problem of grammar induction. This last work has b...
FUIN
2010
13 years 6 months ago
2010
Abstract. A (combinatorial) channel consists of pairs of words representing all possible inputoutput channel situations. In a past paper, we formalized the intuitive concept of “...
ZUM
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. The notion of agents has provided a way of imbuing traditional computing systems with an extra degree of flexibility that allows them to be more resilient and robust in t...