On the number of factors of Sturmian words
Theoretical Computer Science
Aspects of classical language theory
Handbook of formal languages, vol. 1
Handbook of formal languages, vol. 1
Regular Article: Forbidden Words in Symbolic Dynamics
Advances in Applied Mathematics
Theoretical Computer Science
Patterns in words and languages
Discrete Applied Mathematics - Fun with algorithms 2 (FUN 2001)
Theoretical Computer Science - The art of theory
Remarks on arbitrary multiple pattern interpretations
Information Processing Letters
Finite Automata, Palindromes, Powers, and Patterns
Language and Automata Theory and Applications
Detecting palindromes, patterns and borders in regular languages
Information and Computation
| Hi-index | 0.00 |
In this paper some new ideas, problems and results on patterns are proposed. In particular, motivated by questions concerning avoidability, we first study the set of binary patterns that can occur in one infinite binary word, comparing it with the set of factors of the word. This suggests a classification of infinite words in terms of the "difference" between the set of its patterns and the set of its factors. The fact that each factor in an infinite word can give rise to several distinct patterns leads to study the set of patterns of a single finite word. This set, endowed with a natural order relation, defines a poset: we investigate the relationships between the structure of such a poset and the combinatorial properties of the word. Finally we show that the set of patterns of the words in a regular language is a regular language too.