MathOverflow is a question and answer site for professional mathematicians. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Let G be a [ CF ] grammar, and let elements of semiring be sets of rules.

Define multiplication as:

$$ x\otimes y = \{ t| \exists r \in x \exists s \in y (t=subst(r,s))\} $$

where $subst(r,s)$ is rewriting of grammar rule $r$ by formal substitution of one symbol in the rule body matching $s$ head with $s$ body. For example, the rule

expr : expr oper expr

matches itself and rewrites into

expr : expr oper expr oper expr

Next, define addition $ \oplus $ as set union.

Is it known semiring?

share|cite|improve this question
add apostrophes before dollar signs to fix that IIRC. – Will Sawin Nov 19 '11 at 20:16

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.