Words and patterns*

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2295 LNCS, Issue , 2002, Pages 117-129

  Restivo, Antonio ^a   Salemi, Sergio ^a  

^a UNIVERSITY OF PALERMO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LANGUAGES; BINS; SET THEORY;

BINARY PATTERNS; BINARY WORDS; COMBINATORIAL PROPERTIES; FINITE WORDS; INFINITE WORD; ORDER RELATION;

SET THEORY; COMPUTATIONAL LINGUISTICS;

EID: 84876930104     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46011-x_9     Document Type: Conference Paper

References (19)

1. Allouche, J.P.: Sur la complexité des suites infinies. Bull. Belg. Math. Soc. 1 (1994) 133-143
2. Angluin, D.: Finding patterns common to a set of strings. Journal of Computer and System Sciences 21 (1980) 46-62
3. Béal, M.-P., Mignosi, F. Restivo, A., Sciortino, M.: ForbiddenWords in Symbolic Dynamics. Advances in Appl. Math. 25 (2000) 163-193
4. Bean, D.R., Ehrenfeucht, A., McNulty, G.F.: Avoidable patterns in strings of symbols. Pacific J. Math. 85 (1979) 261-294
5. Berstel, J., Séébold, P.: Sturmian Words. In: Algebraic Combinatorics on Words, chapter 2, M.Lothaire (Ed.) Cambridge University Press, 2001
6. Cassaigne, J.: Unavoidable binary patterns. Acta Informatica 30 (1993) 385-395
7. Cassaigne, J.: Unavoidable patterns. In: Algebraic Combinatorics on Words, chapter 3, M. Lothaire (Ed.) Cambridge University Press, 2001
8. Choffrut, C., Karhumäki, J.: Combinatorics ofWords. In: Handbook of Formal Languages, volume 1, chapter 6, 329-438, G.Rozenberg, A.Salomaa (Eds.) Springer, Berlin, 1997
9. Guaiana, D.: On the binary patterns of the Thue-Morse infinite word. Internal Report, University of Palermo, 1996
10. Mateescu, A., Salomaa, A.: Aspects of Classical Language Theory. In: Handbook of Formal Languages, volume 1, chapter 4, 175-251, G.Rozenberg, A.Salomaa (Eds.), Springer, Berlin, 1997
11. Mignosi, F.: On the number of factors of Sturmian words. Theoret. Comput. Sci. 82 (1991) 71-84
12. Mignosi, F., Pirillo, G.: Repetitions in the Fibonacci infinite word. RAIRO Theoretical Informatics and Applications 26(3) (1992) 199-204
13. Mignosi, F., Restivo, A., Sciortino, M.: Words and Forbidden Factors. Theoret. Comput. Sci. 273(1-2) (2001) 99-117
14. Mitrana, V.: Patterns and Languages: An overview. Grammars 2 (1999) 149-173
15. Restivo, A., Salemi, S.: Binary Patterns in Infinite BinaryWords. Lecture Notes in Computer Science (to appear)
16. Roth, P.: Every binary pattern of length six is avoidable on the two-letter alphabet Acta Informatica 29 (1992) 95-107
17. Thue, A.: Über unendliche Zeichenreihen. Kra. Vidensk. Selsk. Skrifter. I. Mat.-Nat. Kl., Christiana 7 1906
18. Thue, A.: Über die gegenseitige Lage gleicher Teile gewisser Zeichenreihen. Kra. Vidensk. Selsk. Skrifter. I. Mat.-Nat. Kl., Christiana 12 1912
19. Zimin, A.I.: Blocking sets of terms. Math. USSR Sb 47 (1984) 353-364