A criterion for the simplicity of finite Moore automata
A Moore automaton A = (A, X,Y,S, A) can be obtained in two steps: first we consider the triplet (A, X, 6) - called a semiautomaton and denoted by S — and then we add the components Y and A which concern the output functioning. Our approach is: S is supposed to be fixed, we vary A in any possible way...
Elmentve itt :
| Szerző: | |
|---|---|
| Dokumentumtípus: | Cikk |
| Megjelent: |
1992
|
| Sorozat: | Acta cybernetica
10 No. 4 |
| Kulcsszavak: | Számítástechnika, Kibernetika, Automaták |
| Tárgyszavak: | |
| Online Access: | http://acta.bibl.u-szeged.hu/12508 |
| LEADER | 01326nab a2200217 i 4500 | ||
|---|---|---|---|
| 001 | acta12508 | ||
| 005 | 20220613102532.0 | ||
| 008 | 161015s1992 hu o 0|| eng d | ||
| 022 | |a 0324-721X | ||
| 040 | |a SZTE Egyetemi Kiadványok Repozitórium |b hun | ||
| 041 | |a eng | ||
| 100 | 1 | |a Ádám András | |
| 245 | 1 | 2 | |a A criterion for the simplicity of finite Moore automata |h [elektronikus dokumentum] / |c Ádám András |
| 260 | |c 1992 | ||
| 300 | |a 221-236 | ||
| 490 | 0 | |a Acta cybernetica |v 10 No. 4 | |
| 520 | 3 | |a A Moore automaton A = (A, X,Y,S, A) can be obtained in two steps: first we consider the triplet (A, X, 6) - called a semiautomaton and denoted by S — and then we add the components Y and A which concern the output functioning. Our approach is: S is supposed to be fixed, we vary A in any possible way, and - among the resulting automata - we want to separate the simple and the nonsimple ones from each other. This task is treated by combinatorial methods. Concerning the efficiency of the procedure, we note that it uses a semiautomaton having |A|(|A| + l)/2 states. | |
| 650 | 4 | |a Természettudományok | |
| 650 | 4 | |a Számítás- és információtudomány | |
| 695 | |a Számítástechnika, Kibernetika, Automaták | ||
| 856 | 4 | 0 | |u http://acta.bibl.u-szeged.hu/12508/1/cybernetica_010_numb_004_221-236.pdf |z Dokumentum-elérés |