Subword complexity and periodicity in two or more dimensions

15h30; Sala 0.06
Wednesday, 3 November, 2004 (All day)

The subword complexity of an infinite string is the function $p(n)$ that counts, for every length $n$, the number of different subwords of length $n$ (blocks of $n$ consecutive symbols) that occur in the string. A classical theorem (Morse and Hedlund

Speaker: 

Julien Cassaigne (Institut de Mathématiques de Luminy)
Error | CMUP

Error

The website encountered an unexpected error. Please try again later.