Complete finite automata network graphs with minimal number of edges

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.

Elmentve itt :
Bibliográfiai részletek
Szerzők: Dömösi Pál
Nehaniv Chrystopher L.
Dokumentumtípus: Cikk
Megjelent: 1999
Sorozat:Acta cybernetica 14 No. 1
Kulcsszavak:Számítástechnika, Kibernetika
Tárgyszavak:
Online Access:http://acta.bibl.u-szeged.hu/12608
Leíró adatok
Tartalmi kivonat: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.
Terjedelem/Fizikai jellemzők:37-50
ISSN:0324-721X