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...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Published: |
1999
|
| Series: | Acta cybernetica
14 No. 1 |
| Kulcsszavak: | Számítástechnika, Kibernetika |
| Subjects: | |
| Online Access: | http://acta.bibl.u-szeged.hu/12610 |
| Summary: | 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 automaton in the given subclass. By taking a special subclass with this property, we arrive at the final result of the paper. |
|---|---|
| Physical Description: | 65-82 |
| ISSN: | 0324-721X |