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

There's a procedure that control engineers (used to) do to calculate the transfer function of a linearized system, gradually reducing a block diagram to a rational function of s. It's justified by Laplace transforms, but leaving the continuous stuff aside, you could imagine it's a purely algebraic procedure on a digraph annotated with rational functions.

There's a similar reduction procedure that undergrad computer science students do to calculate the regular expression from a finite automaton. I think the similarity is something like "they're both Kleene algebras", except that Wikipedia tells me that a Kleene algebra needs to have idempotent +.

Is there something like a Kleene algebra of rational functions, where + is not idempotent?

share|cite|improve this question

This is essentially Schutzenberger's theory of rational power series. I recommend the book of Berstel and Reutenauer Noncommutative Rational Series with Applications.

share|cite|improve this answer

Your Answer


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

Not the answer you're looking for? Browse other questions tagged or ask your own question.