Weighted automata are used to describe quantitative properties in various areas such as probabilistic systems, image compression, speech-to-text processing. The behaviour of such an automaton is a mapping, called a formal power series, assigning to each word a weight in some semiring. We generalize Büchi’s and Elgot’s fundamental theorems to this quantitative setting. We introduce a weighted ve...

We determine conditions under which a left Jordan derivation defined on an $MA$-semiring $S$ is this semiring and prove when implies the commutativity of $S$.

We introduce the notion of ideal, prime ideal, lter, fuzzy ideal, fuzzy prime ideal, fuzzy lter of ordered $Gamma$-semiring and study their properties and relations between them. We characterize the prime ideals and lters of ordered $Gamma$-semiring with respect to fuzzy ideals and fuzzy l- ters respectively.

The concept of the Jacobson radical of a ring is generalized to semirings. A semiring is a system consisting of a set S together with two binary operations, called addition and multiplication, which forms a semigroup relative to addition, a semigroup relative to multiplication, and the right and left distributive laws hold. The additive semigroup of S is assumed to be commutative. The right ide...

We introduce the notion of commuting regular Γsemiring and discuss some properties of commuting regular Γsemiring. We also obtain a necessary and sufficient condition for Γ-semiring to possess commuting regularity. Keywords—Commutative Γ-semiring, Idempotent Γ-semiring, Rectangular Γ-band, Commuting regular Γ-semiring, Clifford Γsemiring.

In theoretical computer science the connection between automata and logic is of fundamental importance. This connection was first considered by Büchi and Elgot in the 1960s, when they showed that the languages accepted by finite automata are precisely those languages that can be defined in monadic second-order logic (MSO). In this thesis we consider extensions of Büchi’s and Elgot’s theorem int...

We introduce the notion of multiendomorphism in a hypergroupoid and the notion of G-semiring. We show that, if (H, ∗) is a commutative semi-hypergroup, these multiendomorphisms form a G-semiring (E,+, ◦,≤), where the operation + is induced by ∗, ◦ is the usual composition of maps ◦ and ≤ is the usual inclusion of maps. Moreover, we show under which conditions the G-semiring (E,+, ◦,≤) is, in fa...

the concept of  -semihyperring is a generalization of semiring, a generalization of semihyperring and a generalization of      -semiring. since the theory of ideals plays an important role in the theory of  - semihyperring, in this paper, we will make an intensive study of the notions of noetherian, artinian, simple and   regular      -semihyperrings. the bulk of this paper...

We aim to generalize Büchi’s fundamental theorem on the coincidence of recognizable and MSO-definable languages to a weighted timed setting. For this, we investigate weighted timed automata and show how we can extend Wilke’s relative distance logic with weights taken from an arbitrary semiring. We show that every formula in our logic can effectively be transformed into a weighted timed automato...