## Abstract

We propose a solution based on networks of picture processors to the problem of picture pattern matching. The network solving the problem can be informally described as follows: it consists of two subnetworks, one of them extracts at each step, simultaneously, all subpictures of identical (progressively decreasing) size from the input picture and sends them to the other subnetwork which checks whether any of the received pictures is identical to the pattern. We present an efficient solution based on networks with evolutionary processors only, for patterns with at most three rows or columns. Afterward, we present a solution based on networks containing both evolutionary and hiding processors running in \({\mathcal {O}}(n+m+kl)\) computational (processing and communication) steps, for any size (*n*, *m*) of the input picture and (*k*, *l*) of the pattern. From the proofs of these results, we infer that any (*k*, *l*)-local language with \(1\le k\le 3\) can be decided in \({\mathcal {O}}(n+m+l)\) computational steps by networks with evolutionary processors only, while any (*k*, *l*)-local language with arbitrary *k*, *l* can be decided in \({\mathcal {O}}(n+m+kl)\) computational steps by networks containing both evolutionary and hiding processors.

## Keywords

Picture Picture processor Hiding processor Picture matching \((k{, } l)\)-Local language## Notes

### Acknowledgments

Victor Mitrana gratefully acknowledges the support of the Alexander von Humboldt Foundation and of the Visiting Professor Programme—“Sapienza” University of Rome.

### Compliance with ethical standards

### Conflict of interest

The authors declare that they have no conflict of interest.

## References

- Adleman LM, Cheng Q, Goel A, Huang M (2001) Running time and program size for self-assembled squares. In: Proceedings of 33rd ACM STOC, pp 740–748Google Scholar
- Aggarwal G et al (2005) Complexities for generalized models of self-assembly. SIAM J Comput 34(2005):1493–1515MathSciNetCrossRefzbMATHGoogle Scholar
- Alarcón PP, Arroyo F, Mitrana V (2012) Networks of polarized evolutionary processors as problem solvers. In: Advances in knowledge-based and intelligent information and engineering systems, frontiers in artificial intelligence and applications. IOS Press, pp 807–815Google Scholar
- Amir A, Benson G, Farach M (1992) Alphabet independent two dimensional matching. In: Proceedings of 24th ACM STOC, pp 59–68Google Scholar
- Bottoni P, Labella A, Mitrana V (2014) Networks of evolutionary picture processors. Fundam Inform 131:337–349MathSciNetzbMATHGoogle Scholar
- Bozapalidis S, Grammatikopoulou A (2005) Recognizable picture series. J Autom Lang Combin 10:159–183MathSciNetzbMATHGoogle Scholar
- Giammarresi D, Restivo A (1997) Two-dimensional languages. In: Handbook of formal languages. Springer, Berlin, pp 215–267Google Scholar
- Giammarresi D, Restivo A (1992) Recognizable picture languages. Int J Pattern Recognit Artif Intell 6:241–256CrossRefzbMATHGoogle Scholar
- Inoue I, Takanami I (1990) A survey of two-dimensional automata theory. In: Proceedings of 5th international meeting of young computer scientists, LNCS 381. Springer, Berlin, pp 72–91Google Scholar
- Manea F (2012) Complexity results for deciding networks of evolutionary processors. Theor Comput Sci 456:65–79MathSciNetCrossRefzbMATHGoogle Scholar
- Manea F, Martín-Vide C, Mitrana V (2004) Solving 3CNF-SAT and HPP in linear time using WWW. Machines. computations, and universality MCU, LNCS 3354. Springer, Berlin , pp 269–280Google Scholar
- Manea F, Martín-Vide C, Mitrana V (2006) All NP-Problems can be solved in polynomial time by accepting networks of splicing processors of constant size. DNA based computers 12, LNCS 4287. Springer, Berlin, pp 47–57Google Scholar
- Manea F, Martín-Vide C, Mitrana V (2010) Accepting networks of evolutionary word and picture processors: A survey. In: Scientific applications of language methods, mathematics, computing, language, and life: frontiers in mathematical linguistics and language theory, vol.2. World Scientific, pp 523–560Google Scholar
- Margenstern M, Mitrana V, Perez-Jimenez M (2005) Accepting hybrid networks of evolutionary systems. DNA based computers 10 LNCS 3384. Springer, Berlin, pp 235–246Google Scholar
- Marriott K, Meyer BE (1998) Visual language theory. Springer, BerlinCrossRefzbMATHGoogle Scholar
- Maürer I (2007) Characterizations of recognizable picture series. Theor Comput Sci 374:214–228MathSciNetCrossRefzbMATHGoogle Scholar
- Rosenfeld A, Kak AC (1982) Digital picture processing. Academic Press, New YorkzbMATHGoogle Scholar
- Rosenfeld A, Siromoney R (1993) Picture languages—a survey. Lang Des 1:229–245Google Scholar
- Siromoney G, Siromoney R, Krithivasan K (1972) Abstract families of matrices and picture languages. Comput Graph Image Process 1:284–307MathSciNetCrossRefzbMATHGoogle Scholar
- Siromoney G, Siromoney R, Krithivasan K (1973) Picture languages with array rewriting rules. Inf Control 22:447–470MathSciNetCrossRefzbMATHGoogle Scholar
- Subramanian KG, Siromoney R (1987) On array grammars and languages. Cybern Syst 18:77–98MathSciNetCrossRefzbMATHGoogle Scholar
- Wang PS (1983) Hierarchical structure and complexities of parallel isometric patterns. IEEE Trans PAM I(5):92–99CrossRefzbMATHGoogle Scholar
- Wang PS (1975) Sequential/parallel matrix array languages. J Cybern 5:19–36MathSciNetCrossRefzbMATHGoogle Scholar
- Wang PS, Bunke H (eds) (1996) Handbook on optical character recognition and document image analysis. World Scientific, SingaporeGoogle Scholar
- Zhu RF, Takaoka T (1989) A technique for two-dimensional pattern matching. Commun ACM 32:1110–1120CrossRefGoogle Scholar