| 2001 |
|---|
| 14 | EE | András Ádám:
On some algebraic properties of automata.
Acta Cybern. 15(1): 1-8 (2001) |
| 1999 |
|---|
| 13 | EE | András Ádám:
On Some Cyclic Connectivity Properties of Directed Graphs (Examples and Problems).
Acta Cybern. 14(1): 1-12 (1999) |
| 1992 |
|---|
| 12 | EE | András Ádám:
A Criterion for the Simplicity of Finite Moore Automata.
Acta Cybern. 10(4): 221-236 (1992) |
| 1986 |
|---|
| 11 | | András Ádám:
On the congruences of finite autonomous Moore automata.
Acta Cybern. 7(3): 259-279 (1986) |
| 1984 |
|---|
| 10 | | András Ádám:
On certain partitions of finite directed graphs and of finite automata.
Acta Cybern. 6: 331-346 (1984) |
| 1981 |
|---|
| 9 | | András Ádám:
On the complexity of codes and pre-codes assigned to finite Moore automata.
Acta Cybern. 5: 117-133 (1981) |
| 1977 |
|---|
| 8 | | András Ádám:
On some open problems of applied automaton theory graph (suggested by the mathematical modelling of certain neuronal networks).
Acta Cybern. 3: 187-214 (1977) |
| 7 | | András Ádám:
On graphs satisfying some conditions for cycles, I.
Acta Cybern. 3: 3-13 (1977) |
| 6 | | András Ádám:
On graphs satisfying some conditions for cycles, II.
Acta Cybern. 3: 69-78 (1977) |
| 1976 |
|---|
| 5 | | András Ádám:
On some aspects of the algebraic description of automaton mappings.
Acta Cybern. 2: 1-21 (1976) |
| 4 | | András Ádám:
An application of truth functions in formalized diagnostics.
Acta Cybern. 2: 291-298 (1976) |
| 1972 |
|---|
| 3 | | András Ádám:
On some generalzations of cyclie networks.
Acta Cybern. 1: 105-119 (1972) |
| 2 | | András Ádám,
J. Bagyinszki:
On some enumeration questions concerning tress and tree-type networks.
Acta Cybern. 1: 129-145 (1972) |
| 1 | | András Ádám,
U. Kling:
On the behavior of some cyclically symmetric networks.
Acta Cybern. 1: 69-79 (1972) |
