András Ádám

15 papers Journal 14Unranked 1
YearRankTypeTitle / Venue / Authors
2009 — conf
On some Properties of Automaton Mappings.
Automata, Formal Languages, and Related Topics
András Ádám
2001 J jnl
On some algebraic properties of automata.
Acta Cybern.
András Ádám
1999 J jnl
On Some Cyclic Connectivity Properties of Directed Graphs (Examples and Problems).
Acta Cybern.
András Ádám
1992 J jnl
A Criterion for the Simplicity of Finite Moore Automata.
Acta Cybern.
András Ádám
1986 J jnl
On the congruences of finite autonomous Moore automata.
Acta Cybern.
András Ádám
1984 J jnl
On certain partitions of finite directed graphs and of finite automata.
Acta Cybern.
András Ádám
1981 J jnl
On the complexity of codes and pre-codes assigned to finite Moore automata.
Acta Cybern.
András Ádám
1977 J jnl
On graphs satisfying some conditions for cycles, II.
Acta Cybern.
András Ádám
1977 J jnl
On some open problems of applied automaton theory and graph theory (suggested by the mathematical modelling of certain neuronal networks).
Acta Cybern.
András Ádám
1976 J jnl
An application of truth functions in formalized diagnostics.
Acta Cybern.
András Ádám
1976 J jnl
On graphs satisfying some conditions for cycles, I.
Acta Cybern.
András Ádám
1973 J jnl
On some aspects of the algebraic description of automaton mappings.
Acta Cybern.
András Ádám
1972 J jnl
On some enumeration questions concerning trees and tree-type networks.
Acta Cybern.
András Ádám, J. Bagyinszki
1971 J jnl
On some generalizations of cyclic networks.
Acta Cybern.
András Ádám
1971 J jnl
On the behavior of some cyclically symmetric networks.
Acta Cybern.
András Ádám, U. Kling