| Research>>> Acta Cybernetica>>> Previous Volumes>>> | Magyarul |
Complete Finite Automata Network Graphs with Minimal Number of Edges
Pál Dömösi3, Chrystopher L. Nehaniv4
Dedicated to Professor Ferenc Gécseg on his 60th birthday
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.
Footnotes:
1 This work was supported by grants of the University of Aizu ``Algebra & Computation'' and ``Automata Networks'' projects (R-10-1, R-10-4), the ``Automata & Formal Languages'' project of the Hungarian Academy of Sciences and Japanese Society for Promotion of Science (No. 15), the Academy of Finland (No 137358), the Hungarian National Foundation for Scientific Research (OTKA T019392), and the Higher Education Research Foundation of the Hungarian Ministry of Education (No. 222).
2 This work was supported by grants of the University of Aizu ``Algebra & Computation'' and ``Automata Networks'' projects (R-10-1, R-10-4), the ``Automata & Formal Languages'' project of the Hungarian Academy of Sciences and Japanese Society for Promotion of Science (No. 15), the Academy of Finland (No 137358), the Hungarian National Foundation for Scientific Research (OTKA T019392), and the Higher Education Research Foundation of the Hungarian Ministry of Education (No. 222).
3 L. Kossuth University, Institute of Mathematics and Informatics, 4032 Debrecen, Egyetem tér 1, Hungary, e-mail: domosi@@math.klte.hu
4 School of Computer Science & Engineering University of Aizu, Aizu-Wakamatsu City 965, Japan, e-mail: nehaniv@@u-aizu.ac.jp