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.
By:
Bjørn Kjos-Hanssen Imprint: De Gruyter Country of Publication: Germany Dimensions:
Height: 240mm,
Width: 170mm,
Weight: 394g ISBN:9783110774818 ISBN 10: 311077481X Series:De Gruyter Series in Logic & its Applications Pages: 156 Publication Date:19 February 2024 Audience:
Professional and scholarly
,
Undergraduate
Format:Hardback Publisher's Status: Active
Bjørn Kjos-Hanssen, University of Hawaii at Manoa, USA.