Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 11 of 11 for “"Semirings"”.
-
Ideal theory in polynomial semirings
Electronic Thesis or Dissertation
-
Grothendieck Semirings and Definable Endofunctions
"We define the Grothendieck semiring of a category in a way suitable for the categories of definable sets and functions which occur in Model Theory, and also emphasize Euler characteristics, that is, invariant measures simultaneously additive and multiplicative on the classes of objects of such …
-
Operator semigroups with applications to semirings
Electronic Thesis or Dissertation
-
Extensive categories, commutative semirings and Galois theory
We describe the Galois theory of commutative semirings as a Boolean Galois theory in the sense of Carboni and Janelidze. Such a Galois structure then naturally suggests an extension to commutative semirings of the classical theory of quadratic equations over commutative rings. We show, however, …
-
Fault-tolerant computation in semigroups and semirings
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1995.
-
Completely Positive Matrices Over Semirings and Their CP-rank
… special types of algebraic structures called semirings. Semirings satisfy all properties of unital rings except the existence of additive inverses. We formulate a notion of complete positivity for matrices over semirings and show that this notion of complete positivity over special types of …
-
Graph and Hypergraph Decompositions for Exact Algorithms
… and (ii) evaluation of multilinear forms over semirings. In the first part of the thesis we develop new algorithms for graph and hypergraph problems based on techniques (i) and (ii). While these techniques are independently both useful, the work presented in this part is largely characterised …
-
Algebraic structures from quantum and fuzzy logics
… quantum and fuzzy structures with certain semirings is proved. The last chapter concerns an application of group theory to some well known mathematical puzzles.
-
Kleene-Type Results for Weighted Tree-Automata
… to formal tree-series over commutative semirings (the Kleene theorem states the coincidence between rational and recognizable formal languages). To this end weighted tree-languages are introduced and the Kleene-theorem is proved for them. The desired result for formal tree-series is then …
-
Decidability for Residuated Lattices and Substructural Logics
… coincides with simple extensions of idempotent semirings. On the decidability front, we develop both semantical and syntactical methods for establishing decidability as well as tractability of decision procedures. On the undecidability front, we develop a notion of algebraic machines for which …
-
Expressiveness and Decidability of Weighted Automata and Weighted Logics
… a weighted MSO logic with arbitrary commutative semirings as weight structure. In the second part, we lift four decidability results from max-plus word automata to max-plus tree automata. Max-plus word and tree automata are weighted automata over the max-plus semiring and assign real numbers to …