ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
Theoretical Computer Science
Volume 330, Issue 2, 2 February 2005, Pages 205-220
Descriptional Complexity of Formal Systems
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Purchase PDF (238 K)

 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/j.tcs.2004.07.035    How to Cite or Link Using DOI (Opens New Window)
Copyright © 2005 Elsevier B.V. All rights reserved.

On the size complexity of hybrid networks of evolutionary processors

Juan Castellanosa, E-mail The Corresponding Author, Peter Leupoldb, E-mail The Corresponding Author and Victor Mitranab, c, Corresponding Author Contact Information, E-mail The Corresponding Author

aDepartment of Artificial Intelligence, Polytechnical University of Madrid, Campus de Montegancedo, 28660 Boadilla del Monte, Madrid, Spain bResearch Group in Mathematical Linguistics, Rovira i Virgili University, Pça. Imperial Tarraco 1, 43005 Tarragona, Spain cFaculty of Mathematics and Computer Science, University of Bucharest, Str. Academiei 14, 70109 Bucharest, Romania

Received 17 November 2003; 
revised 6 April 2004; 
accepted 5 July 2004. 
Available online 22 October 2004.

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

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.

Keywords: Evolutionary operations; Evolutionary processor; Hybrid network of evolutionary processors; Size complexity; Connectivity


Theoretical Computer Science
Volume 330, Issue 2, 2 February 2005, Pages 205-220
Descriptional Complexity of Formal Systems
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.