Overview
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.
The book, Automatic Complexity: A Computable Measure of Irregularity [Bulk, Wholesale, Quantity] ISBN#9783110774818 in Hardcover by Bjørn Kjos-Hanssen may be ordered in bulk quantities. Minimum starts at 25 copies. Availability based on publisher status and quantity being ordered.
Details