Abstract
In this paper we consider four variants of accepting networks of evolutionary processors with in-place computations, that is the length of every word in every node at any step in the computation is bounded by the length of the input word. These devices are called here accepting networks of non-inserting evolutionary processors (ANNIEP shortly). The variants differ in two respects: filters that are used to control the exchange of information, i.e., we use random context conditions and regular languages as filters, and the way of accepting the input word, i.e., at least one output node or all output nodes are nonempty at some moment in the computation. The computational power of these devices is investigated. In the case of filters defined by regular languages, both variants lead to the class of context-sensitive languages. If random context conditions are used for defining filters, all linear context-free languages and some non-semilinear (even over the one-letter alphabet) can be accepted with both variants. Moreover, some closure properties of the classes of languages ANNIEPs with random context filters are also given.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alhazov, A., Dassow, J., Rogozhin, Y., Truthe, B.: Personal communication
Castellanos, J., Martín-Vide, C., Mitrana, V., Sempere, J.: Networks of evolutionary processors. Acta Informatica 38, 517–529 (2003)
Csuhaj-Varj, E., Salomaa, A.: Networks of parallel language processors. In: Păun, G., Salomaa, A. (eds.) New Trends in Formal Languages. LNCS, vol. 1218, pp. 299–318. Springer, Heidelberg (1997)
Csuhaj-Varj, E., Mitrana, V.: Evolutionary systems: a language generating device inspired by evolving communities of cells. Acta Informatica 36, 913–926 (2000)
Csuhaj-Varjú, E., Martín-Vide, C., Mitrana, V.: Hybrid NEPs are computationally complete. Acta Informatica 41, 257–272 (2005)
Dassow, J., Truthe, B.: On the power of networks of evolutionary processors. In: Durand-Lose, J., Margenstern, M. (eds.) MCU 2007. LNCS, vol. 4664, pp. 158–169. Springer, Heidelberg (2007)
Errico, L., Jesshope, C.: Towards a new architecture for symbolic processing. In: Artificial Intelligence and Information-Control Systems of Robots, vol. 94, pp. 31–40. World Scientific, Singapore (1994)
Fahlman, S., Hinton, G., Seijnowski, T.: Massively parallel architectures for AI: NETL, THISTLE and Boltzmann Machines. In: Proc. AAAI National Conf. on AI, pp. 109–113. William Kaufman, Los Altos (1983)
Hillis, W.: The Connection Machine. MIT Press, Cambridge (1985)
Manea, F., Martín-Vide, C., Mitrana, V.: On the size complexity of universal accepting hybrid networks of evolutionary processors. Mathematical Structures in Computer Science 17, 753–771 (2007)
Manea, F., Mitrana, V.: All NP-problems can be solved in polynomial time by accepting hybrid networks of evolutionary processors of constant size. Information Processing Letters 103, 112–118 (2007)
Manea, F., Margenstern, M., Mitrana, V., Perez-Jimenez, M.: A new characterization of NP, P, and PSPACE with accepting hybrid networks of evolutionary processors (submitted)
Margenstern, M., Mitrana, V., Perez-Jimenez, M.: Accepting hybrid networks of evolutionary systems. In: Ferretti, C., Mauri, G., Zandron, C. (eds.) DNA 2004. LNCS, vol. 3384, pp. 235–246. Springer, Heidelberg (2005)
Martín-Vide, C., Mitrana, V.: Networks of evolutionary processors: results and perspectives. In: Molecular Computational Models: Unconventional Approaches, pp. 78–114. Idea Group Publishing, Hershey (2005)
Păun, G., Sntean, L.: Parallel communicating grammar systems: the regular case. Annals of University of Bucharest, Ser. Matematica-Informatica 38, 55–63 (1989)
Păun, G.: Computing with membranes. Journal of Computer and System Sciences 61, 108–143 (2000)
Sankoff, D., et al.: Gene order comparisons for phylogenetic inference: evolution of the mitochondrial genome. In: Proceedings of the National Academy of Sciences of the United States of America, vol. 89, pp. 6575–6579 (1992)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Dassow, J., Mitrana, V. (2009). Accepting Networks of Non-inserting Evolutionary Processors. In: Priami, C., Back, RJ., Petre, I. (eds) Transactions on Computational Systems Biology XI. Lecture Notes in Computer Science(), vol 5750. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04186-0_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-04186-0_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04185-3
Online ISBN: 978-3-642-04186-0
eBook Packages: Computer ScienceComputer Science (R0)