English
Related papers

Related papers: Simulation vs. Equivalence

200 papers

Esik and Maletti introduced the notion of a proper semiring and proved that some important (classes of) semirings -- Noetherian semirings, natural numbers -- are proper. Properness matters as the equivalence problem for weighted automata…

Logic in Computer Science · Computer Science 2018-02-27 Ana Sokolova , Harald Woracek

Simulations of weighted tree automata (wta) are considered. It is shown how such simulations can be decomposed into simpler functional and dual functional simulations also called forward and backward simulations. In addition, it is shown in…

Formal Languages and Automata Theory · Computer Science 2015-05-18 Zoltán Ésik , Andreas Maletti

In this paper, we inspect a relatively unexplored notion of finite generation in semirings, namely semirings in which all congruences are finitely generated. Such semirings are dubbed Congruence Noetherian. After developing sufficient…

Rings and Algebras · Mathematics 2025-11-18 Snehinh Sen

A semiring is uniserial if its ideals are totally ordered by inclusion. First, we show that a semiring $S$ is uniserial if and only if the matrix semiring $M_n(S)$ is uniserial. As a generalization of valuation semirings, we also…

Commutative Algebra · Mathematics 2022-06-22 H. Behzadipour , P. Nasehpour

Let $S$ be a semiring. An $S$-semimodule $M$ is called a multiplication semimodule if for each subsemimodule $N$ of $M$ there exists an ideal $I$ of $S$ such that $N=IM$. In this paper we investigate some properties of multiplication…

Commutative Algebra · Mathematics 2019-04-29 Rafieh Razavi Nazari , Shaban Ghalandarzadeh

The semiring of discrete dynamical systems is a simple algebraic model for modularity in deterministic systems. The objects of the semiring are finite transformations (viewed as directed graphs and regarded up to isomorphism), the sum of…

Rings and Algebras · Mathematics 2026-03-30 Maximilien Gadouleau , Marianne Johnson

For a commutative semiring S, by an S-algebra we mean a commutative semiring A equipped with a homomorphism from S to A. We show that the subvariety of S-algebras determined by the identities 1+2x=1 and x^2=x is closed under non-empty…

Category Theory · Mathematics 2023-07-11 George Janelidze , Manuela Sobral

Injective modules play an important role in characterizing different classes of rings (e.g. Noetherian rings, semisimple rings). Some semirings have no non-zero injective semimodules (e.g. the semiring of non-negative integers). In this…

Rings and Algebras · Mathematics 2019-04-17 Jawad Abuhlail , Rangga Ganzar Noegraha

A finitely generated module C over a commutative noetherian ring R is semidualizing if Hom_R(C,C) \cong R and Ext^i_R(C,C) = 0 for all i \geq 1. For certain local Cohen-Macaulay rings (R,m), we verify the equality of Hilbert-Samuel…

Commutative Algebra · Mathematics 2012-09-04 Susan M. Cooper , Sean Sather-Wagstaff

We study the first-order axiomatisability of finite semiring interpretations or, equivalently, the question whether elementary equivalence and isomorphism coincide for valuations of atomic facts over a finite universe into a commutative…

Logic · Mathematics 2021-02-11 Erich Grädel , Lovro Mrkonjić

A semiring can be ``completed'' (i.e., embedded into a semiring in which all infinite sums are defined and satisfy some reasonable properties) iff this semiring can be naturally partially ordered. This construction is ``natural'' (a left…

Rings and Algebras · Mathematics 2007-05-23 Martin Goldstern

In this paper, we are mainly interested in the two questions "which are the commutative rings on which every finitely presented modules is [Formula: see text]-periodic (respectively, [Formula: see text]-periodic)?". It is proved that these…

Commutative Algebra · Mathematics 2022-03-08 Driss Bennis , François Couchot

Our main result states that a finite semiring of order >2 with zero which is not a ring is congruence-simple if and only if it is isomorphic to a `dense' subsemiring of the endomorphism semiring of a finite idempotent commutative monoid. We…

Rings and Algebras · Mathematics 2007-05-23 Jens Zumbrägel

In this paper, we introduce and study e-injective semimodules, in particular over additively idempotent semirings. We completely characterize semirings all of whose semimodules are e-injective, describe semirings all of whose projective…

Rings and Algebras · Mathematics 2016-08-10 J. Y. Abuhlail , S. N. Il'in , Y. Katsov , T. G. Nam

Perfect Gabriel filters of right ideals and their corresponding right rings of quotients have the desirable feature that every module of quotients is determined solely by the right ring of quotients. On the other hand, symmetric rings of…

Rings and Algebras · Mathematics 2010-09-14 Lia Vas

One can find lists of whole numbers having equal sum and product. We call such a creature a bioperational multiset. No one seems to have seriously studied them in areas outside whole numbers such as the rationals, Gaussian integers, or…

Rings and Algebras · Mathematics 2019-08-12 Onno M. Cain

We investigate ideal-semisimple and congruence-semisimple semirings. We give several new characterizations of such semirings using e-projective and e-injective semimodules. We extend several characterizations of semisimple rings to (not…

Rings and Algebras · Mathematics 2019-08-02 Jawad Y. Abuhlail , Rangga Ganzar Noegraha

We call a semigroup $S$ f-noetherian if every right congruence of finite index on $S$ is finitely generated. We prove that every finitely generated semigroup is f-noetherian, and investigate whether the properties of being f-noetherian and…

Group Theory · Mathematics 2020-02-13 Craig Miller

A semiring $S$ which is a union of rings is called completely regular, if moreover, it is orthodox then $S$ is called an orthoring. Here we study the orthorings $S$ such that $E^+(S)$ is a band semiring. Every band semiring is a spined…

Rings and Algebras · Mathematics 2017-06-09 A. K. Bhuniya , R. Debnath

A finite automaton is called bideterministic if it is both deterministic and codeterministic -- that is, if it is deterministic and its transpose is deterministic as well. The study of such automata in a weighted setting is initiated. All…

Formal Languages and Automata Theory · Computer Science 2023-10-02 Peter Kostolányi
‹ Prev 1 2 3 10 Next ›