What is it about?
The paper defines new complexity measure for infinite words using known measure for finite words. The Sturmian words can be characterized by these notions.
Featured Image
Read the Original
This page is a summary of: Complexity for finite factors of infinite sequences, Theoretical Computer Science, April 1999, Elsevier,
DOI: 10.1016/s0304-3975(98)00258-8.
You can read the full text:
Contributors
The following have contributed to this page
