Dömösi, Pál

Nehaniv, Chrystopher L.

English

An automata network graph is said to be n-complete (under projection) if every automata network having underlying graph with n vertices can be simulated (under projection) on it. In this paper n-complete automata network graphs with minimal number of edges are completely characterized

Dömösi Pál

Nehaniv Chrystopher L.

University of Szeged

Complete finite automata network graphs with minimal number of edges

http://acta.bibl.u-szeged.hu/12608/1/cybernetica_014_numb_001_037-050.pdf

Complete finite automata network graphs with minimal number of edges

Abstract

Similar works

Full text

Available Versions

University of Szeged