Many statistical translation models can be regarded as weighted logical deduction. Under this paradigm, we use weights from the expectation semiring (Eisner, 2002), to compute first-order statistics (e.g., the expected hypothesis length or feature counts) over packed forests of translations (lattices or hypergraphs). We then introduce a novel second-order expectation semiring, which computes se...

We present a new generic-removal algorithm for weighted automata and transducers deened over a semiring. The algorithm can be used with any semiring covered by our framework and works with any queue discipline adopted. It can be used in particular in the case of unweighted automata and transducers and weighted automata and transducers deened over the tropical semiring. It is based on a general ...

We extend arc consistency algorithms proposed in the literature in order to deal with not necessarily invertible semirings. As a result, consistency algorithms can now be used as a preprocessing procedure in soft CSPs defined over a larger class of semirings: either partially ordered, or with non idempotent ×, or not closed ÷ operator, or constructed as cartesian product or Hoare power sets of ...

A Γ-semihyperring is a generalization of a semiring, a generalization of a semihyperring and a generalization of a Γ-semiring. In this paper, we define the notion of a fuzzy (prime) Γ-hyperideal of a Γ-semihyperring. Then we prove some results in this respect. Also, by using the notion of fuzzy Γ-hyperideals, we give several characterizations of Γ-semihyperrings. 2000 Mathematics Subject Classi...

We investigate the theory of skew (formal) power series introduced by Droste, Kuske [5, 6], if the basic semiring is a Conway semiring. This yields Kleene Theorems for skew power series, whose supports contain finite and infinite words. We then develop a theory of convergence in semirings of skew power series based on the discrete convergence. As an application this yields a Kleene Theorem prov...

We introduce a weighted logic with discounting and we establish Büchi’s and Elgot’s theorem for weighted automata over finite words and arbitrary commutative semirings. Then we investigate Büchi and Muller automata with discounting over the max-plus and the min-plus semiring. We show their expressive equivalence with weighted MSO-sentences with discounting. In this case our logic has a purely s...

We present a general algorithm, pre-determinization, that makes an arbitrary weighted transducer over the tropical semiring or an arbitrary unambiguous weighted transducer over a cancellative commutative semiring determinizable by inserting in it transitions labeled with special symbols. After determinization, the special symbols can be removed or replaced with -transitions. The resulting trans...

Two examples of automata-theoretic models for the validation of xml documents against user-de ned schema are the stepwise unranked tree automaton (suta) and the parallel unranked tree automaton (puta). By adding a weight, taken from some semiring, to every transition we generalise these two qualitative automata models to quantitative models, thereby obtaining weighted stepwise unranked tree aut...

In this article, we introduce the notion of near semiring with involution. Generalizing the theory of semirings we aim at represent quantum structures, such as basic algebras and orthomodular lattices, in terms of near semirings with involution. In particular, after discussing several properties of near semirings, we introduce the so-called Łukasiewicz near semirings, as a particular case of ne...

Idempotent matrices play a significant role while dealing with different questions in matrix theory and its applications. It is easy to see that over a field any idempotent matrix is similar to a diagonal matrix with 0 and 1 on the main diagonal. Over a semiring the situation is quite different. For example, the matrix J of all ones is idempotent over Boolean semiring. The first characterizatio...