| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 439244 | Theoretical Computer Science | 2008 | 6 Pages |
Abstract
We derive Schützenberger’s characterisation of the set of recognizable formal power series as a formal corollary from Kleene’s characterisation of the set of regular languages.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
