Building on earlier work that integrates different factors in language modeling, we view (i) backing off to a shorter history and (ii) class-based generalization as two complementary mechanisms of using a larger equivalence class for prediction when the default equivalence class is too small for reliable estimation. This view entails that the classes in a language model should be learned from r...

Bloom, B. and A.R. Meyer, Experimenting with process equivalence, Theoretical Computer Science 101 (1992) 223-237. Distinctions between concurrent processes based on observable outcomes of computational experiments are examined. The equivalence determined by a general class of experiments involving duplication of processes can be characterized by a notion of ready simulation resembling, but str...

the largest class of algebraic hyper structures satisfying the module like axioms is the v h -module. in this paper, we consider the category of v h -modules and prove that the direct limit alwaysexists in this category. direct limits are defined by a universal property, and so are unique. the mostpowerful tool in order to obtain a module from a given v h - module is the quotient out procedure....

We introduce a new class of operations called asymmetric equivalences. Several properties of asymmetric equivalence operations have been investigated. Based on the asymmetric equivalence, quasi-metric spaces are constructed on [0, 1]. Finally, we discuss symmetrization of asymmetric equivalences.

formed by the homotopy classes of equivalence maps from X into itself with the operation induced by the composition of maps. It is clear to see that this group depends only on the homotopy type of X, hence should be determined by the known homotopy invariants of X. This is the problem which we shall try to study here. In fact, there exists a spectral sequence converging to S[X], whose initial t...

This document specifies how Label Edge Routers (LERs) should behave when determining whether to MPLS encapsulate an IPv4 packet with header options. Lack of a formal standard has resulted in different LER forwarding behaviors for IPv4 packets with header options despite being associated with a prefix-based Forwarding Equivalence Class (FEC). IPv4 option packets that belong to a prefix-based FEC...

The label advertising behavior of an LDP speaker for a given Forwarding Equivalence Class (FEC) is governed by the FEC type and not necessarily by the LDP session's negotiated label advertisement mode. This document updates RFC 5036 to make that fact clear. It also updates RFCs 3212, 4447, 5918, 6388, and 7140 by specifying the label advertisement mode for all currently defined LDP FEC types. I...

This dissertation contributes to analysis methods for infinite-state systems. The dissertation focuses on equivalence testing for two relevant classes of infinite-state systems: commutative context-free processes, and one-counter automata. As for equivalence notions, we investigate the classical bisimulation and simulation equivalences. The important point is that we allow for silent steps in t...

One of the most common ways of representing classes of equivalent Bayesian networks is the use of essential graphs. These chain graphs are also known in the literature as completed patterns or completed pdags. The name essential graph was proposed by Andersson, Madigan and Perlman (1997a) who also gave a graphical characterization of essential graphs. In this contribution an alternative charact...

The label advertising behavior of an LDP speaker for a given Forwarding Equivalence Class (FEC) is governed by the FEC type and not necessarily by the LDP session's negotiated label advertisement mode. This document updates RFC 5036 to make that fact clear. It also updates RFCs 3212, 4447, 5918, 6388, and 7140 by specifying the label advertisement mode for all currently defined LDP FEC types. I...