Axiomatizing iteration categories
We associate an identity with every finite automaton and show that a set of equations consiting of some classical identities as well as the equations associated with a subclass of finite automata is complete for iteration theories if and only if every finite simple group divides the semigroup of an...
Elmentve itt :
| Szerző: | |
|---|---|
| Dokumentumtípus: | Cikk |
| Megjelent: |
1999
|
| Sorozat: | Acta cybernetica
14 No. 1 |
| Kulcsszavak: | Számítástechnika, Kibernetika |
| Tárgyszavak: | |
| Online Access: | http://acta.bibl.u-szeged.hu/12610 |