Author(s): Bj‚àö‚àèrn Kjos-Hanssen
Publisher: De Gruyter
ISBN: 9783110774818
Edition: 1st Edition
$39,99
Delivery: This can be downloaded Immediately after purchasing.
Version: Only PDF Version.
Compatible Devices: Can be read on any device (Kindle, NOOK, Android/IOS devices, Windows, MAC)
Quality: High Quality. No missing contents. Printable
Recommended Software: Check here
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.
premiumjs@helps24hours.com
Rated 4.9
