Dömösi Pál and Nehaniv Chrystopher L.: Complete finite automata network graphs with minimal number of edges. In: Acta cybernetica, (14) 1. pp. 37-50. (1999)
Preview |
Cikk, tanulmány, mű
cybernetica_014_numb_001_037-050.pdf Download (921kB) | Preview |
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.
| Item Type: | Article |
|---|---|
| Journal or Publication Title: | Acta cybernetica |
| Date: | 1999 |
| Volume: | 14 |
| Number: | 1 |
| ISSN: | 0324-721X |
| Page Range: | pp. 37-50 |
| Language: | English |
| Place of Publication: | Szeged |
| Related URLs: | http://acta.bibl.u-szeged.hu/38507/ |
| Uncontrolled Keywords: | Számítástechnika, Kibernetika |
| Additional Information: | Bibliogr.: 50. p. ; összefoglalás angol nyelven |
| Subjects: | 01. Natural sciences 01. Natural sciences > 01.02. Computer and information sciences |
| Date Deposited: | 2016. Oct. 15. 12:26 |
| Last Modified: | 2022. Jun. 14. 08:30 |
| URI: | http://acta.bibl.u-szeged.hu/id/eprint/12608 |
Actions (login required)
 |
View Item |
