# Semiring examples from formal language theory

I'm learning algebraic theory of parsing. My first problem is identifying semiring examples which are specific to formal language theory. Here is an attempt to construct two examples.

1 Given CNF grammar, the elements of semiring are sets of terminal and nonterminal symbols with the operations:

i) Multiplication, joining the two sets pair-wise according to CYK rule. For example given CNF grammar

s: p p | q r
t: p q
u: q q


then

$\{p,q,r\}\otimes \{p,r\} = \{s,t\}$

ii) Addition is set union, e.g.

$\{p,q\}\oplus \{q,r\} = \{p,q,r\}$

Unfortunately, multiplication is not associative.

2 The elements of second semiring are sets of not symbols but grammar rules [not necessarily in CNF] amended with position. The operations are

i) Multiplication, joining all matching pairs of elements according to Earley complete rule. For example given CNF grammar

s: p q r
r: s t | u


then

$\{s: p \bullet q r,s: p q \bullet r\}\otimes \{r: u \bullet \} = \{s: p q r \bullet \}$

ii) Addition is again the set union, e.g.

$\{s: p \bullet q r, r: \bullet s t\}\oplus \{r: u \bullet \} = \{s: p \bullet q r, r: \bullet s t, r: u \bullet\}$

This example is also deficient.

Semiring with elements being sets of grammar rules and multiplication being rule substitution seems to work fine. Yet, this is just relation algebra in disguise. Indeed, let view each grammar rule as an equivalence class -- a set of pairs of words consisting terminal and nonterminal letters related by rule's application, e.g.

$[t : s a] = \{ (t,sa),(ta,saa),(bt,bsa),(abt,absa),... \}$

Then, recognition of a word in a grammar is a chain of relational compositions, e.g.

$[t:sa] \otimes [s:aa] \otimes \{(aaa,aaa)\} = \{(t,aaa)\}$

(This monomial is reminiscent of semiring parser polynomial from Josh Goodman PhD thesis; however, let reiterate that constructing new semirings by taking polynomials and matrices is not of our interest here).

So, the question remains: is the semiring of formal languages over alphabet $\Sigma$ the only example?

• Doesn't this depend on what you mean by "specific to formal language theory"? Goodman's seminal "Semiring Parsing" has a slew of examples of semirings; surely the Boolean semiring is relevant to formal language theory, even if it's not specific to formal language theory. Nov 21, 2011 at 19:00
• Yes it's subjective. Three examples above (two nonexamples:-) illustrate that the construction is expected to involve grammar rules or nonterminals, at least. Nov 22, 2011 at 5:35
• I am ready to answer the question raised in the title (there are indeed plenty of semirings occurring in formal language theory), but I am puzzled by your examples. It seems that you are looking for very specific examples. So, do you wish to have any example relevant to formal languages or specific ones occurring in parsing? Sep 18, 2013 at 17:32
• Yes, I had an expectation of semirings unique to formal language theory, and the above three examples demonstrate my failure to notice any. Still, please exhibit your examples: I'm eager to study semirings that I'm not familiar with. Sep 25, 2013 at 18:08

## 3 Answers

There are plenty of semirings related to language theory. First of all, the Boolean semiring. Next any class of languages closed under finite union and (concatenation) product is a subsemiring of the semiring of all languages. For instance the rational (= regular) languages form a semiring. See also the related notion of Kleene algebra.

The $k \times k$ matrices over a semiring do form a semiring. In particular, matrices over the Boolean semiring encode nondeterministic finite automata and matrices over the slightly larger semiring $\{-\infty, 0, 1\}$ encode transitions of a Büchi automaton. Matrices over a semiring are used to characterize rational series.

The tropical semirings, in particular $(\mathbb{N} \cup \{+\infty\}, \min, +)$ and $(\mathbb{N} \cup \{-\infty\}, \max, +)$ play a proeminent role in automata theory. They also led to a new branch of mathematics, the tropical geometry.

I think you can come up with more semi-rings with Earley rules. Take Prediction. You can form the binary operator $S\otimes_{p,k} T = S \cup \bigcup (Y: \bullet \gamma$, k)$such that the union is over all the relevantly existing rules. Then the algorithm first calculates the first Earley state set as an infinite but eventually repeating (so finite) product in the operator:$S(0) = \bigotimes_{p,0}^{\infty} S_0(0)\$. I don't know if this forms a semi-ring with union though. Maybe it forms relationships with other operations as well.

• I don't understand: why multiplication operation is parametrized by something? Next, is multiplication in your definition total (i.e. applied to any pair of objects (rule,position))? Sep 25, 2013 at 18:58
• @TegiriNenashi Idk! I came back to your post from a google search and found this, and I have no idea what I was trying to say. Weird... Jul 29, 2017 at 7:13