On the number of nodes in universal networks of evolutionary processors

被引：0
|
作者：
Artiom Alhazov
Carlos Martín-Vide
Yurii Rogozhin
机构：
[1] Academy of Sciences of Moldova,Institute of Mathematics and Computer Science
[2] Rovira i Virgili University,Research Group on Mathematical Linguistics
来源：
Acta Informatica | 2006年 / 43卷
关键词：
Regular Language; Mathematical Linguistics; Hybrid Network; Grammar System; Connection Machine;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
We consider the networks of evolutionary processors (NEP) introduced by J. Castellanos, C. Martí n-Vide, V. Mitrana and J. Sempere recently. We show that every recursively enumerable (RE) language can be generated by an NEP with three nodes modulo a terminal alphabet and moreover, NEPs with four nodes can generate any RE language. Thus, we improve existing universality result from five nodes down to four nodes. For mNEPs (a variant of NEPs where operations of different kinds are allowed in the same node) we obtain optimal results: each RE language can be generated by an mNEP with one node modulo a terminal alphabet, and mNEPs with two nodes can generate any RE language; this is not possible for mNEPs with one node. Some open problems are formulated.
引用
收藏
页码：331 / 339
页数：8
相关论文
共 50 条
  • [1] On the number of nodes in universal networks of evolutionary processors
    Alhazov, Artiom
    Martin-Vide, Carlos
    Rogozhin, Yurii
    ACTA INFORMATICA, 2006, 43 (05) : 331 - 339
  • [2] On Networks of Evolutionary Processors with Nodes of Two Types
    Alhazov, Artiom
    Martin-Vide, Carlos
    Truthe, Bianca
    Dassow, Juergen
    Rogozhin, Yurii
    FUNDAMENTA INFORMATICAE, 2009, 91 (01) : 1 - 15
  • [3] Variants of Networks of Evolutionary Processors with Polarizations and a Small Number of Processors
    Freund, Rudolf
    Rogojin, Vladimir
    Verlan, Sergey
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2019, 30 (6-7) : 1005 - 1027
  • [4] Small universal accepting hybrid networks of evolutionary processors
    Remco Loos
    Florin Manea
    Victor Mitrana
    Acta Informatica, 2010, 47 : 133 - 146
  • [5] Small universal accepting hybrid networks of evolutionary processors
    Loos, Remco
    Manea, Florin
    Mitrana, Victor
    ACTA INFORMATICA, 2010, 47 (02) : 133 - 146
  • [6] On Accepting Networks of Evolutionary Processors with at Most Two Types of Nodes
    Mitrana, Victor
    Truthe, Bianca
    LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS, 2009, 5457 : 588 - +
  • [7] About Universal Hybrid Networks of Evolutionary Processors of Small Size
    Alhazov, Artiom
    Csuhaj-Varju, Erzsebet
    Martin-Vide, Carlos
    Rogozhin, Yurii
    LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS, 2008, 5196 : 28 - +
  • [8] Small Universal Accepting Networks of Evolutionary Processors with Filtered Connections
    Loos, Remco
    Manea, Florin
    Mitrana, Victor
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2009, (03): : 173 - 182
  • [9] On the size complexity of universal accepting hybrid networks of evolutionary processors
    Manea, Florin
    Martin-Vide, Carlos
    Mitrana, Victor
    MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE, 2007, 17 (04) : 753 - 771
  • [10] Computational Completeness of Networks of Evolutionary Processors with Elementary Polarizations and a Small Number of Processors
    Freund, Rudolf
    Rogojin, Vladimir
    Verlan, Sergey
    DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS, DCFS 2017, 2017, 10316 : 140 - 151
12345