Sale!
20% Off

Automatic Complexity: A Computable Measure of Irregularity

Original price was: ₹16568.00.Current price is: ₹13254.00.

2 in stock


Author BjC8rn, Kjos-Hanssen
ISBN 9783110774818
Published Language English
Publication Year 2024
Publisher De Gruyter
Binding Hardback
Original Price €174.95
Pages 144
Ships By 7-8 days
SKU: DG-1653 Categories: ,

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.

Additional information

Author

,

ISBN

Published Language

Publication Year

Publisher

Binding

Original Price

Pages

144

Ships By

7-8 days