REMARKS ON ALGEBRAIC DECOMPOSITION OF AUTOMATA,
Abstract
A version of the Krohn-Rhodes decomposition theorem for finite automata is proved in which capabilities as well as semigroups are preserved. Another elementary proof of the usual Krohn-Rhodes theorem is also presented. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Aug 01, 1968
- Accession Number
- AD0676013
Entities
People
- A. R. Meyer
- Callie M Thompson
Organizations
- Carnegie Mellon University