Complete finite automata network graphs with minimal number of edges

Pál Dömösi; Chrystopher L. Nehaniv

Complete finite automata network graphs with minimal number of edges

Pál Dömösi
, Chrystopher L. Nehaniv

Research output: Contribution to journal › Article › peer-review

1 Citation (Scopus)

Abstract

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.

Original language	English
Pages (from-to)	37-50
Number of pages	14
Journal	Acta Cybernetica
Volume	14
Issue number	1
Publication status	Published - 1 Jan 1999

Cite this

@article{dfddc1f7bf5c4ec7aa7165d5159fc6a7,

title = "Complete finite automata network graphs with minimal number of edges",

abstract = "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.",

author = "P{\'a}l D{\"o}m{\"o}si and Nehaniv, \{Chrystopher L.\}",

year = "1999",

month = jan,

day = "1",

language = "English",

volume = "14",

pages = "37--50",

journal = "Acta Cybernetica",

issn = "0324-721X",

publisher = "University of Szeged, Institute of Informatics",

number = "1",

}

TY - JOUR

T1 - Complete finite automata network graphs with minimal number of edges

AU - Dömösi, Pál

AU - Nehaniv, Chrystopher L.

PY - 1999/1/1

Y1 - 1999/1/1

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/12444312875

M3 - Article

AN - SCOPUS:12444312875

SN - 0324-721X

VL - 14

SP - 37

EP - 50

JO - Acta Cybernetica

JF - Acta Cybernetica

IS - 1

ER -

Complete finite automata network graphs with minimal number of edges

Abstract

Other files and links

Fingerprint

Cite this