Finite-State Complexity and the Size of Transducers
Formal Languages and Automata Theory
2010-08-11 v1
Abstract
Finite-state complexity is a variant of algorithmic information theory obtained by replacing Turing machines with finite transducers. We consider the state-size of transducers needed for minimal descriptions of arbitrary strings and, as our main result, we show that the state-size hierarchy with respect to a standard encoding is infinite. We consider also hierarchies yielded by more general computable encodings.
Keywords
Cite
@article{arxiv.1008.1667,
title = {Finite-State Complexity and the Size of Transducers},
author = {Cristian Calude and Kai Salomaa and Tania Roblot},
journal= {arXiv preprint arXiv:1008.1667},
year = {2010}
}
Comments
In Proceedings DCFS 2010, arXiv:1008.1270