Search results for "Semiring"

showing 3 items of 3 documents

Basic Measure Theory

2020

In this chapter, we lay the measure theoretic foundations of probability theory. We introduce the classes of sets (semirings, rings, algebras, σ-algebras) that allow for a systematic treatment of events and random observations. Using the measure extension theorem, we construct measures, in particular probability measures on σ-algebras. Finally, we define random variables as measurable maps and study the σ-algebras generated by certain maps.

AlgebraProbability theoryExtension (predicate logic)Construct (philosophy)Random variableMeasure (mathematics)SemiringMathematicsProbability measure
researchProduct

Pseudocomplements in sum-ordered partial semirings

2007

We study a particular way of introducing pseudocomplementation in ordered semigroups with zero, and characterise the class of those pseudocomplemented semigroups, termed g-semigroups here, that admit a Glivenko type theorem (the pseudocomplements form a Boolean algebra). Some further results are obtained for g-semirings – those sum-ordered partially additive semirings whose multiplicative part is a g-semigroup. In particular, we introduce the notion of a partial Stone semiring and show that several well-known elementary characteristics of Stone algebras have analogues for such semirings.

Class (set theory)Algebra and Number TheorySemigroupApplied MathematicsBoolean algebra (structure)Multiplicative functionZero (complex analysis)Type (model theory)SemiringKleene algebraCombinatoricssymbols.namesakesymbolsComputer Science::Formal Languages and Automata TheoryMathematicsDiscussiones Mathematicae - General Algebra and Applications
researchProduct

Two-way automata with multiplicity

2005

We introduce the notion of two-way automata with multiplicity in a semiring. Our main result is the extension of Rabin, Scott and Shepherdson's Theorem to this more general case. We in fact show that it holds in the case of automata with multiplicity in a commutative semiring, provided that an additional condition is satisfied. We prove that this condition is also necessary in a particular case. An application is given to zig-zag codes using special two-way automata.

Pure mathematicsFinite-state machineRegular languageLocal configurationCommutative semiringMultiplicity (mathematics)Computer Science::Formal Languages and Automata TheorySemiringAutomatonMathematics
researchProduct