Description

Automatic Complexity discusses a treatment of a computable form of Kolmogorov complexity, in which Turing machines are replaced by finite automata. The complexities of many types of words are studied, including random words, normal words, Fibonacci words, Thue words, and words produced by linear feedback shift registers.

Automatic Complexity discusses the treatment of a computable form of Kolmogorov complexity, in which Turing machines are replaced by finite automata. It covers the Combinatorics on words most likely to be encountered.