We consider tree automata with costs over semirings in the sense of (Seidl, 1994). We define the concept of a finitely factorizing semiring and of a monotonic semiring, both as the generalization of well-known particular semirings, and show that the costfiniteness of tree automata with costs over finitely factorizing and monotonic semirings is decidable. We show that, for tree automata with cos...

Weighted languages and weighted automata over multi-hemirings are capable of expressing quantitative properties of systems such as its average or discounted costs. We study the applicability of well-known semiring theory and algorithms in the field of multi-hemirings. To this end, we embed multi-hemirings into semirings and extend this embedding for weighted languages and weighted automata. We ...

Cost register automata (CRAs) are one-way finite automata whose transitions have the side effect that a register is set to the result of applying a state-dependent semiring operation to a pair of registers. Here it is shown that CRAs over the tropical semiring (N∪{∞},min,+) can simulate polynomial time computation, proving along the way that a naturally defined width-k circuit value problem ove...

The semiring-based constraint satisfaction problems (semiring CSPs), proposed by Bistarelli, Montanari and Rossi [3], is a very general framework of soft constraints. In this paper we propose an abstraction scheme for soft constraints that uses semiring homomorphism. To find optimal solutions of the concrete problem, the idea is, first working in the abstract problem and finding its optimal sol...

Cost register automata (CRAs) are one-way finite automata whose transitions have the side effect that a register is set to the result of applying a state-dependent semiring operation to a pair of registers. Here it is shown that CRAs over the tropical semiring (N∪{∞},min,+) can simulate polynomial time computation, proving along the way that a naturally defined width-k circuit value problem ove...

We consider tree automata with costs over semirings in the sense of (Seidl, 1994). We de ne the concept of a nitely factorizing semiring and of a monotonic semiring, both as the generalization of well-known particular semirings, and show that the costniteness of tree automata with costs over nitely factorizing and monotonic semirings is decidable. We show that, for tree automata with costs over...

In continuation of a previous works on semirings [5], in the present paper we introduce the notions of a strong ternary semiring (ST-semiring) (that is a ternary semirings with an additional condition called the left invertive law). We prove that many results obtained in [5] for semirings are still valid in the present case. We establish some relationships between the idempotents for both the a...

In this paper we propose a semiring-theoretic approach to MV-algebras based on the connection between such algebras and idempotent semirings established in [11] and improved in [4] — such an approach naturally imposing the introduction and study of a suitable corresponding class of semimodules, called MV-semimodules. Besides some basic yet fundamental results of more general interest for semiri...

We associate with every commutative continuous semiring S and alphabet Σ a category whose objects are all sets and a morphism X → Y is determined by a function from X into the semiring of formal series S⟪(Y ⊎Σ) ⟫ of finite words over Y ⊎Σ, an X × Y -matrix over S⟪(Y ⊎Σ) ⟫, and a function from X into the continuous S⟪(Y ⊎Σ) ⟫-semimodule S⟪(Y ⊎Σ) ⟫ of series of ωwords over Y ⊎Σ. When S is also an...