Ten serwis zostanie wyłączony 2025-02-11.
Nowa wersja platformy, zawierająca wyłącznie zasoby pełnotekstowe, jest już dostępna.
Przejdź na https://bibliotekanauki.pl

PL EN


Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników
2014 | Vol. 131, nr 3-4 | 337--349
Tytuł artykułu

Accepting Networks of Evolutionary Picture Processors

Wybrane pełne teksty z tego czasopisma
Warianty tytułu
Języki publikacji
EN
Abstrakty
EN
We extend the study of networks of evolutionary processors accepting words to a similar model, processing rectangular pictures. To this aim, we introduce accepting networks of evolutionary picture processors and investigate their computational power. We show that these networks can accept the complement of any local picture language as well as picture languages that are not recognizable. Some open problems regarding decidability issues and closure properties are finally discussed.
Wydawca

Rocznik
Strony
337--349
Opis fizyczny
Bibliogr. 16 poz., tab.
Twórcy
autor
  • Department of Computer Science, “Sapienza”, University of Rome, Via Salaria 113, 00198 Rome, Italy, bottoni@di.uniroma1.it
autor
  • Department of Computer Science, “Sapienza”, University of Rome, Via Salaria 113, 00198 Rome, Italy, labella@di.uniroma1.it
autor
  • Department of Computer Science, University of Bucharest, Str. Academiei nr. 14, 010014, Bucharest, Romania, mitrana@fmi.unibuc.ro
Bibliografia
  • [1] Csuhaj-Varjú, E., Martın-Vide, C., Mitrana, V.: Hybrid NEPs are computationally complete, Acta Informatica, 41(4-5), 2005, 257–272.
  • [2] Giammarresi, D., Restivo, A.: Two-dimensional languages, in [9], 215–267.
  • [3] Giammarresi, D., Restivo, A.: Recognizable picture languages, Int. J. Pattern Recognition and Artificial Intelligence, 6, 1992, 241–256.
  • [4] Inoue, I., Takanami, I.: A survey of two-dimensional automata theory, in Proc. 5th Int. Meeting of Young Computer Scientists, Lecture Notes in Computer Science 381, 1990, 72–91.
  • [5] Margenstern, M., Mitrana, V., Perez-Jimenez, M.: Accepting hybrid networks of evolutionary systems, in DNA Based Computers 10 Lecture Notes in Computer Science 3384, 2005, 235–246.
  • [6] Martın-Vide, C., Mitrana, V.: Networks of evolutionary processors: results and perspectives, in Molecular Computational Models: Unconventional Approaches, Idea Group Publishing, Hershey, 2005, 78–114.
  • [7] Nivat, M., Saoudi, A., Subramanian, K.G., Siromoney, R., Dare, V.R.: Puzzle grammars and context-free array grammars, Int. J. Pattern Recognition and Artificial Inteligence, 5, 1991, 663–676.
  • [8] Rosenfeld, A., Siromoney, R.: Picture languages – a survey, Languages of design, 1, 1993, 229–245.
  • [9] Rozenberg, G., Salomaa, A. (eds.), Handbook of Formal Languages, Springer–Verlag, Berlin, vol. I–III, 1997.
  • [10] Sankoff, D. et al.: Gene order comparisons for phylogenetic inference:evolution of the mitochondrial genome, Proceedings of the National Academy of Sciences of the United States of America 89, 1992, 6575–6579.
  • [11] Siromoney, G., Siromoney, R., Krithivasan, K.: Abstract families of matrices and picture languages, Computer Graphics and Image Processing, 1, 1972, 284–307.
  • [12] Siromoney, G., Siromoney, R., Krithivasan, K.: Picture languages with array rewriting rules, Information and Control, 22, 1973, 447–470.
  • [13] Subramanian, K.G., Siromoney, R., Dare, V.R., Saoudi, A.: Basic puzzle languages, Int. J. Pattern Recognition and Artificial Intelligence, 9, 1995, 763–775.
  • [14] Subramanian, K.G., Siromoney, R.: On array grammars and languages, Cybernetics and Systems, 18, 1987, 77–98.
  • [15] Wang, P.S.: Hierarchical structure and complexities of parallel isometric patterns, IEEE Trans. PAM I, 5, 1975, 92–99.
  • [16] Wang, P.S.: Sequential/parallel matrix array languages, Journal of Cybernetics, 5, 1975, 19–36
Typ dokumentu
Bibliografia
Identyfikatory
Identyfikator YADDA
bwmeta1.element.baztech-82d05faf-10cb-43e3-9080-2413447f19b5
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.