|
|
|
|
| LEADER |
01884nmm a2200313 u 4500 |
| 001 |
EB002200209 |
| 003 |
EBX01000000000000001337412 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
240402 ||| eng |
| 020 |
|
|
|a 978-3-11-077487-0
|
| 100 |
1 |
|
|a Kjos-Hanssen, Bjørn
|
| 245 |
0 |
0 |
|a Automatic Complexity
|h Elektronische Ressource
|b A Computable Measure of Irregularity
|c Bjørn Kjos-Hanssen
|
| 260 |
|
|
|a Berlin ; Boston
|b De Gruyter
|c 2024, ©2024
|
| 300 |
|
|
|a XII, 144 pages
|
| 505 |
0 |
|
|a Intro -- Preface -- Acknowledgments -- Contents -- 1 First steps in automatic complexity -- 2 Nondeterminism and overlap-free words -- 3 Edge complexity and digraphs -- 4 The many variants -- 5 The incompressibility theorem -- 6 Conditional automatic complexity -- 7 Logical depth and automatic complexity -- Bibliography -- Index
|
| 653 |
|
|
|a Automaten
|
| 653 |
|
|
|a Komplexität
|
| 653 |
|
|
|a Turingtheorie
|
| 653 |
|
|
|a Kolmogorov complexity
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b GRUYMPG
|a DeGruyter MPG Collection
|
| 490 |
0 |
|
|a De Gruyter Series in Logic and Its Applications
|
| 028 |
5 |
0 |
|a 10.1515/9783110774870
|
| 776 |
|
|
|z 978-3-11-077490-0
|
| 776 |
|
|
|z 978-3-11-077481-8
|
| 856 |
4 |
0 |
|u https://www.degruyter.com/document/doi/10.1515/9783110774870
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 004.01
|
| 520 |
|
|
|a 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.
|