|
Organizers |
Simmetry as periodicity and periodicity as the lowest possible complexity
by
Solomon Marcus
Romanian Academy , Mathematics
Periodicity in infinite words was investigated in a classical paper by Morse and Hendlund (1938), but its consideration in connection with complexity is much more recent. We propose an approach to complexity via different possible extensions of periodicity, mainly the almost periodicity introduced by Harald Bohr in mathematical analysis and extended then to the discrete case. We bridge this problem with some phenomena related to formal languages, mainly with the so-called "word complexity".
Date received: March 14, 2000
Copyright © 2000 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Conferences Inc. Document # caet-36.