Repetitions, fullness, and uniformity in two-dimensional words

International Journal of Foundations of Computer Science

Volumn 15, Issue 2, 2004, Pages 355-383

  Carpi, Arturo ^a,c   De Luca, Aldo ^b,c  

^a UNIVERSITY OF PERUGIA   (Italy)

^b UNIVERSITY OF NAPLES FEDERICO II   (Italy)

^c CNR   (Italy)

Author keywords

2D words; de Bruijn 2D words; full 2D words; pictures; uniform 2D words

Indexed keywords

EID: 33746927248     PISSN: 01290541     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0129054104002479     Document Type: Article

References (18)

1. A. Amir, G. Benson, Two-dimensional periodicity in rectangular arrays, SIAM J. Comput. 27 (1998) 90-106.
2. M.-P. Beal, F. Fiorenzi, F. Mignosi, Minimal forbidden patterns of multidimensional shifts, Int. J. Algebra Comput, to appear.
3. N. J. Calkin, H. S. Wilf, The number of independent sets in a grid graph, SIAM J. Discrete Math. 11 (1998) 54-60.
4. A. Carpi, A. de Luca, Repetitions and Boxes in Words and Pictures, in: J. Karhumaki, H. Maurer, G. Paun, G. Rozenberg (Eds.), Jewels are Forever, Springer (Berlin, 1999) pp. 295-306.
5. A. Carpi, A. de Luca, On the distribution of characteristic parameters of words II, Theoret. Informatics Appl. 36 (2002) 97-127.
6. A. Carpi, A. de Luca, Uniform words, Adv. Appl. Math., to appear (see also: Full and uniform sequences, Proc. Steklov Inst. Math. 242 (2003) 130135, extended abstract).
7. A. Carpi, A. de Luca, S. Varricchio, Words, univalent factors, and boxes, Acta Inform. 38 (2002) 409-436.
8. M. Crochemore, C. Hancart, Automata for matching patterns, in: G. Rozenberg, A. Salomaa (Eds.), Handbook of Formal Languages, vol. 2, Springer (Berlin, 1997) pp. 399-462.
9. N. G. de Bruijn, A combinatorial problem, Nederl. Akad. Wetensch. Proc. 49 (1946) 758-764.
10. H. Fredricksen, A survey of full length nonlinear shift register cycle algorithms, SIAM Review 24 (1982) 195-221.
11. D. Giammarresi, A. Restivo, Two-dimensional Languages, in: G. Rozenberg, A. Salomaa (Eds.), Handbook of Formal Languages, vol. 3, Springer (Berlin, 1997) pp. 215-265.
12. J. Karhumaki, W. Plandowski, W. Rytter, The complexity of compressing subsegments of images described by finite automata, Discrete Appl. Math. 125 (2003) 235-254.
13. B. P. Kitchens, Symbolic Dynamics: One-sided, Two-sided, and Countable State Markov Shifts, Springer (Berlin, 1998).
14. B. P. Kitchens, Dynamics of Zd actions on Markov subgroups, in: F. Blanchard, A. Maass, A. Nogueira (Eds.) Topics in Symbolic Dynamics and Applications, London Math. Soc. Lecture Notes Ser., vol. 279, Cambridge University Press (Cambridge, 2000) pp. 89-122.
15. A. Lempel, J. Ziv, Compression of individual sequences via variable-rate coding, IEEE Trans. Inform. Theory 24 (1978) 530-536.
16. M. Lothaire, Combinatorics on Words, 2nd Edition, Cambridge Mathematical Library, Cambridge University Press (Cambridge, UK, 1997).
17. F. Mignosi, A. Restivo, M. Sciortino, Forbidden factors and fragment assembly, Theoret. Informatics Appl. 35 (2001) 565-577.
18. F. Mignosi, A. Restivo, P. V. Silva, On Fine and Wilf's theorem for bidimensional words, Theoret. Comput. Sci. 292 (2003) 245-262.