On a conjecture on bidimensional words

Theoretical Computer Science

Volumn 299, Issue 1-3, 2003, Pages 123-150

  Epifanio, Chiara ^a   Koskas, Michel ^b   Mignosi, Filippo ^a  

^a UNIVERSITY OF PALERMO   (Italy)

^b NONE

Author keywords

Bidimensional words; Combinatorics on words; Complexity functions; Periodicity

Indexed keywords

FORMAL LANGUAGES; THEOREM PROVING; VECTORS;

BIDIMENSIONAL WORDS;

COMPUTATIONAL COMPLEXITY;

EID: 0037453343     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(01)00386-3     Document Type: Article

References (38)

1. A. Amir, G.E. Benson, Alphabet independent two-dimensional pattern matching, Proc. 24th ACM Symp. Theory on Computers, 1992, pp. 59-68.
2. A. Amir, G.E. Benson, Two-dimensional periodicity and its applications, Proc. 3rd ACM-SIAM Symp. on Discrete Algorithms, 1992, pp. 440-452.
3. Amir A., Benson G.E. Two-dimensional periodicity in rectangular arrays. SIAM J. Comput. 27(1):1998;90-106.
4. A. Amir, M. Farach, Efficient matching of nonrectangular shapes, Ann. Math. Artif. Intell., special issue on the Foundations of Artificial Intelligence (4) (1991) 211-224.
5. A. Amir, M. Farach, Two dimensional dictionary matching, Inform. Process. Lett. 1992, Vol. 44, pp. 233-239.
6. A. Amir, G.E. Benson, M. Farach, An alphabet independent approach to two dimensional pattern matching, SIAM J. Comput. 23(2) (1994) 313-323 (preliminary version appeared in STOC 92).
7. Berthé V., Vuillon L. Tilings and rotations: a two-dimensional generalization of Sturmian sequences. Discrete Math. 223:2000;27-33.
8. J. Cassaigne, Double sequences with complexity mn+1. J. Auto. Lang. Comb. 4 (1999), pp. 153-170.
9. J. Cassaigne, Private communication, 1999.
10. J. Cassaigne, D. Bernardi, Private communication, 1997.
11. Debled I., Reveillès J.P. A linear algorithm for segmentation of digital curves. IEEE Int. J.P.R.A.I. 1995.
12. Delone [B.N. Delaunay] B.N., Dolbilin N.P., Shtogrin M.I., Galiulin R.V. A local criterion for regularity of a system of points. Sov. Math. Dokl. 17(2):1976;319-322.
13. de Luca A., Varricchio S. Regularity and finiteness conditions. Rozenberg G., Salomaa A. Handbook of Formal Languages. Vol. 1:1997;747-810 Springer, Berlin.
14. N.P. Dolbilin, J.C. Lagarias, M. Senechal, Multiregular point systems, Discrete Comput. Geom., to appear.
15. Fine N.J., Wilf H.S. Uniqueness theorem for periodic functions. Proc. Amer. Math. Soc. 16:1965;109-114.
16. Z. Galil, R. Giancarlo, On the exact complexity of string matching: upper bounds,SIAM J. Comp. 20(6) 1008-1020.
17. Galil Z., Park K. Alphabet-independent two-dimensional witness computation. Siam J. Comput. 25(5):1996;907-935.
18. Z. Galil, K. Park, Truly alphabet independent two-dimensional pattern matching, Proc. 33rd IEEE Symp. on Foundations of Computer Science, 1992, pp. 247-256.
19. R. Giancarlo, F. Mignosi, Generalizations of the periodicity theorem of Fine and Wilf, CAAP94, Lecture Notes in Computer Science, Vol. 787, Springer, Berlin, pp. 130-141.
20. Koskas M. Complexités de Suites de Toeplitz. Discr. Math. 83:1998;161-183.
21. Lothaire, Combinatorics on words, Encyclopedia of Mathemathics and its Applications, Vol. 17, Addison-Wesley, Reading, MA, 1983.
22. Lothaire, Algebraic combinatorics on words, Available for the moment at URL http://www-igm.univ-mlv.fr/̃berstel/Lothaire.
23. Lyndon R.C., Schupp P.E. Combinatorial Group Theory. 1977;Springer, Berlin.
24. p in a free group Michigan Math. J. 9(4):1962;289-298.
25. F. Mignosi, A. Restivo, P.V. Silva, On Fine and Wilf's theorem for bidimensional words, Theoret. Comput. Sci., to appear.
26. Morse M., Hedlund G.A. Symbolic dynamics. Amer. J. Math. 60:1938;815-866.
27. M. Nivat, Invited talk at ICALP'97.
28. Radin C. The pinwheel tilings of the plane. Ann. Math. 139:1994;661-702.
29. M. Regnier, L. Rostami, A unifying look at d-dimensional periodicities and space coverings, Proc. 4th Symposium on Combinatorial Pattern Matching, 1993, pp. 215-227.
30. J.P. Reveillès, Géométrie Discrète, Calcul en nombres entiers et algorithmique, Thèse D'État, Université Louis Pasteur, Strasbourg, 1991.
31. J.P. Reveillès, Combinatorial pieces in digital lines and planes, Vision Geometry, IV, San Diego, CA, 1995, pp. 23-34.
32. Rosenfeld A., Kak A.C. Digital Picture Processing. 1982;Academic Press, New York.
33. k Math. Z. 233:2000;205-218.
34. Sander J.W., Tijdeman R. The complexity of functions on lattices. Theoret. Comput. Sci. 246:2000;195-225.
35. J.W. Sander, R. Tijdeman, The rectangle complexity of functions on two-dimensional lattices, Theoret. Comput. Sci., to appear.
36. Vuillon L. Combinatoire des motifs d'une suite sturmienne bidimensionnelle. Theoret. Comput. Sci. 209:1998;261-285.
37. L. Vuillon, Contribution à l'étude des pavages et des surfaces discrètisées, Ph.D. Thesis, Aix-Marseille II, December, 1996.
38. Vuillon L. Local configurations in discrete planes. Bull. Belg. Math. Soc. 6:1999;625-636.