Schutzenberger's theorem on formal power series follows from Kleene's theorem
We derive Schutzenberger's characterisation of the set of recognizable formal power series as a formal corollary from Kleene's characterisation of the set of regular languages. (c) 2008 Elsevier B.V. All rights reserved.
formal power series regular languages weighted automata