Complexity of ideals in finite semigroups and finite-state machines
- 1 March 1967
- journal article
- Published by Springer Nature in Theory of Computing Systems
- Vol. 1 (1) , 59-66
- https://doi.org/10.1007/bf01692497
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- RESULTS ON FINITE SEMIGROUPS DERIVED FROM THE ALGEBRAIC THEORY OF MACHINESProceedings of the National Academy of Sciences, 1965
- Algebraic theory of machines. I. Prime decomposition theorem for finite semigroups and machinesTransactions of the American Mathematical Society, 1965
- On the Structure of SemigroupsAnnals of Mathematics, 1951