Scott, Dana, Javno predavanje februar 2003

Iz MaFiRaWiki

Infinite Words

Carnegie Mellon University
24.2.2003 ob 18h

Over 20 years ago, I spent a lot of time thinking about completions of the free monoid of finite words on finitely many generators to allow infinite words. The completion to the free profinite monoid is one cannonical choice; however, it is difficult to get a complete grasp of the structure of this monoid. The lecture will review the basic definitions and the applications to the characterization of varieties of finite moniods, and will formulate some problems.

Osebna orodja