Automatic Complexity A Computable Measure of Irregularity
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 fee...
| Main Author: | |
|---|---|
| Format: | eBook |
| Language: | English |
| Published: |
Berlin ; Boston
De Gruyter
2024, ©2024
|
| Series: | De Gruyter Series in Logic and Its Applications
|
| Subjects: | |
| Online Access: | |
| Collection: | DeGruyter MPG Collection - Collection details see MPG.ReNa |
| Summary: | 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. |
|---|---|
| Physical Description: | XII, 144 pages |
| ISBN: | 978-3-11-077487-0 |