Few Paths, Fewer Words: Model Selection With Automatic Structure Functions

DOI10.1080/10586458.2017.1368048zbMath1419.68057arXiv1608.01399OpenAlexW2487976656MaRDI QIDQ5743090

Bjørn Kjos-Hanssen

Publication date: 8 May 2019

Published in: Experimental Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1608.01399

zbMATH Keywords

model selectionstructure functionsfinite automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Statistical aspects of information-theoretic topics (62B10)

Related Items (2)

Automatic complexity of Fibonacci and tribonacci words ⋮ An incompressibility theorem for automatic complexity

Cites Work

• Unnamed Item
• Nondeterministic automatic complexity of overlap-free and almost square-free words
• Kolmogorov structure functions for automatic complexity
• Shift registers fool finite automata
• The Kolmogorov complexity of infinite words
• Kolmogorov's Structure Functions and Model Selection

This page was built for publication: Few Paths, Fewer Words: Model Selection With Automatic Structure Functions