Institute of Informatics>>> Acta Cybernetica>>> Past Issues>>>

Magyarul

Publications of András Ádám in Acta Cybernetica.

1.   András Ádám. On some algebraic properties of automata. Acta Cybernetica, 15(1):1-8, 2001. [ PDF ]

2.   András Ádám. On Some Cyclic Connectivity Properties of Directed Graphs (Examples and Problems). Acta Cybernetica, 14(1):1-12, 1999. [ PDF ]

3.   András Ádám. A criterion for the simplicity of finite Moore automata. Acta Cybernetica, 10(4):221-236, 1992. [ PDF ]

4.   András Ádám. On the congruences of finite autonomous Moore automata. Acta Cybernetica, 7(3):259-279, 1986. [ PDF ]

5.   András Ádám. On certain partitions of finite directed graphs and of finite automata. Acta Cybernetica, 6(4):331-346, 1984. [ PDF ]

6.   András Ádám. On the complexity of codes and pre-codes assigned to finite Moore automata. Acta Cybernetica, 5(2):117-133, 1981. [ PDF ]

7.   András Ádám. On graphs satisfying some conditions for cycles, II.. Acta Cybernetica, 3(2):69-78, 1977. [ PDF ]

8.   András Ádám. On some open problems of applied automaton theory and graph theory (suggested by the mathematical modelling of certain neuronal networks). Acta Cybernetica, 3(3):187-214, 1977. [ PDF ]

9.   András Ádám. On graphs satisfying some conditions for cycles, I.. Acta Cybernetica, 3(1):3-13, 1976. [ PDF ]

10.   András Ádám. On some aspects of the algebraic description of automaton mappings. Acta Cybernetica, 2(1):1-21, 1973. [ PDF ]

11.   András Ádám and J. Bagyinszki. On some enumeration questions concering trees and tree-type networks. Acta Cybernetica, 1(3):129-145, 1972. [ PDF ]

12.   András Ádám. On some generalzations of cyclic networks. Acta Cybernetica, 1(2):105-119, 1971. [ PDF ]

13.   András Ádám and U. Kling. On the behavior of some cyclically symmetric networks. Acta Cybernetica, 1(2):69-79, 1971. [ PDF ]

 This document was translated from BibTEX by bibtex2html