Patterns in words and languages

Discrete Applied Mathematics

Volumn 144, Issue 3, 2004, Pages 237-246

  Castiglione, G ^a   Restivo, A ^a   Salemi, S ^a  

^a UNIVERSITY OF PALERMO   (Italy)

Author keywords

Formal languages; Partial order on words; Pattern

Indexed keywords

PARTIAL ORDER ON WORDS; PATTERNS; PERMUTATION;

AUTOMATION; COMBINATORIAL MATHEMATICS; MATHEMATICAL MODELS; MATHEMATICAL OPERATORS; PROBLEM SOLVING;

FORMAL LANGUAGES;

EID: 9644274027     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2003.11.003     Document Type: Article

References (16)

1. D. Angluin, Finding patterns common to a set of strings, J. Comput. System Sci. 21 (1980) 46-62.
2. D.R. Bean, A. Ehrenfeucht, G.F. McNulty, Avoidable patterns in strings of symbols, Pacific J. Math. 85 (1979) 261-294.
3. J. Cassaigne, Unavoidable binary patterns, Acta Inform. 30 (1993) 385-395.
4. C. Choffrut, J. Karhumäki, Combinatorics of words, in: G. Rozenberg, A. Salomaa (Eds.), Handbook of Formal Languages, Vol. 1, Springer, Berlin, 1997, pp. 329-438 (Chapter 6).
5. P. Goralcik, T. Vanicek, Binary patterns in binary words, Internat. J. Algebra Comput. 1 (1991) 387-391.
6. J.E. Hopcroft, R. Motwani, J.D. Ullman, Introduction to Automata Theory, Languages and Computation, Addison-Wesley, Reading, MA, 2001.
7. M. Lothaire, Algebraic Combinatorics on Words, Cambridge University Press, Cambridge, 2002.
8. A. Mateescu, A. Salomaa, Aspects of classical language theory, in: G. Rozenberg, A. Salomaa (Eds.), Handbook of Formal Languages, Vol. 1, Springer, Berlin, 1997, pp. 175-251 (Chapter 4).
9. V. Mitrana, Patterns and languages: an overview, Grammars 2 (1999) 149-173.
10. J. Neraud, Equations in words: an algorithmic contribution, Bull. Belg. Math. Soc. 1 (1994) 253-283.
11. A. Restivo, S. Salemi, Words and patterns, Lect. Notes Comput. Sci. 2295 (2002) 117-129.
12. A. Restivo, S. Salemi, Binary patterns in infinite binary words, Lect. Notes Comput. Sci. 23005 (2002) 107-116.
13. P. Roth, Every binary pattern of length six is avoidable on the two-letter alphabet, Acta Inform. 29 (1992) 95-107.
14. A. Thue, Über unendliche Zeichenreihen, Kra. Vidensk. Selsk. Skrifter. I. Mat.-Nat. Kl., Christiana 7 (1906) 1-22.
15. A. Thue, Über die gegenseitige Lage gleicher Teile gewisser Zeichenreiben, Kra. Vidensk. Selsk. Skrifter. I. Mat.-Nat. Kl., Christiana 12 (1912) 1-67.
16. A.I. Zimin, Blocking sets of terms, Math. USSR Sb 47 (1984) 353-364.