On the size complexity of hybrid networks of evolutionary processors

Authors:
Juan Castellanos;Peter Leupold;Victor Mitrana
Affiliations:
Department of Artificial Intelligence, Polytechnical University of Madrid, Campus de Montegancedo, 28660 Boadilla del Monte, Madrid, Spain;Research Group in Mathematical Linguistics, Rovira i Virgili University, Pça. Imperial Tarraco 1, 43005 Tarragona, Spain;Research Group in Mathematical Linguistics, Rovira i Virgili University, Pça. Imperial Tarraco 1, 43005 Tarragona, Spain and Faculty of Mathematics and Computer Science, University of Buchare ...
Venue:
Theoretical Computer Science - Descriptional complexity of formal systems
Year:
2005

Citing 7
Cited 15

The connection machine

The connection machine
Towards a new architecture for symbolic processing

AIICSR'94 Proceedings of the sixth international conference on Artificial intelligence and information-control systems of robots
Handbook of Formal Languages

Handbook of Formal Languages
Networks of Parallel Language Processors

New Trends in Formal Languages - Control, Cooperation, and Combinatorics (to Jürgen Dassow on the occasion of his 50th birthday)
Solving NP-Complete Problems With Networks of Evolutionary Processors

IWANN '01 Proceedings of the 6th International Work-Conference on Artificial and Natural Neural Networks: Connectionist Models of Neurons, Learning Processes and Artificial Intelligence-Part I
Hybrid networks of evolutionary processors

GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartI
Accepting hybrid networks of evolutionary processors

DNA'04 Proceedings of the 10th international conference on DNA computing

Accepting networks of splicing processors: Complexity results

Theoretical Computer Science
On the size complexity of universal accepting hybrid networks of evolutionary processors

Mathematical Structures in Computer Science
On the recognition of context-free languages using accepting hybrid networks of evolutionary processors

International Journal of Computer Mathematics
On Accepting Networks of Splicing Processors of Size 3

CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Multi-agent Simulation of Linguistic Processes: A NEPs Perspective

Agent Computing and Multi-Agent Systems
On Networks of Evolutionary Processors with Nodes of Two Types

Fundamenta Informaticae - Machines, Computations and Universality, Part I
On the size of computationally complete hybrid networks of evolutionary processors

Theoretical Computer Science
PNEPs, NEPs for Context Free Parsing: Application to Natural Language Processing

IWANN '09 Proceedings of the 10th International Work-Conference on Artificial Neural Networks: Part I: Bio-Inspired Systems: Computational and Ambient Intelligence
Computing Natural Language with Biomolecules: Overview and Challenges

IWINAC '09 Proceedings of the 3rd International Work-Conference on The Interplay Between Natural and Artificial Computation: Part I: Methods and Models in Artificial and Natural Computation. A Homage to Professor Mira's Scientific Legacy
A Universal Accepting Hybrid Network of Evolutionary Processors

Electronic Notes in Theoretical Computer Science (ENTCS)
On the power of networks of evolutionary processors

MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
Target Based Accepting Networks of Evolutionary Processors

Fundamenta Informaticae - Non-Classical Models of Automata and Applications
Biocomputing: an insight from linguistics

Natural Computing: an international journal
Accepting networks of splicing processors

CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
On Networks of Evolutionary Processors with Nodes of Two Types

Fundamenta Informaticae - Machines, Computations and Universality, Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

The goal of this paper is twofold. Firstly, to survey in a systematic and uniform way the main results regarding the size descriptional complexity measures of hybrid networks of evolutionary processors as generating devices. Secondly, we improve some results about a size measure, prove that it is connected, and discuss the possibility of computing this measure for regular and context-free languages. We also briefly present a few NP-complete problems and recall how they can be solved in linear time by accepting networks of evolutionary processors with linearly bounded resources (nodes, rules, symbols). Finally, the size complexity of accepting hybrid networks of evolutionary processors recognizing all NP languages in polynomial time is briefly discussed.