Algorithmic information theory
Algorithmic information theory
Tight lower bounds in the length of word chains
Information Processing Letters
Automaticity I: properties of a measure of descriptional complexity
Journal of Computer and System Sciences
Approximating the smallest grammar: Kolmogorov complexity in natural models
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Introduction to the Theory of Computation
Introduction to the Theory of Computation
Automatic complexity of strings
Journal of Automata, Languages and Combinatorics - Special issue: selected papers of the second internaional workshop on Descriptional Complexity of Automata, Grammars and Related Structures (London, Ontario, Canada, July 27-29, 2000)
Approximation algorithms for grammar-based compression
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Information and Randomness: An Algorithmic Perspective
Information and Randomness: An Algorithmic Perspective
Simulating finite automata with context-free grammars
Information Processing Letters
Resource-Bounded Kolmogorov Complexity Revisited
STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science
Application of Lempel--Ziv factorization to the approximation of grammar-based compression
Theoretical Computer Science
Approximation algorithms for grammar-based data compression
Approximation algorithms for grammar-based data compression
On the Complexity of Optimal Grammar-Based Compression
DCC '06 Proceedings of the Data Compression Conference
Entropy rates and finite-state dimension
Theoretical Computer Science
Visualization 2001 Conference (Acm
Visualization 2001 Conference (Acm
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Computability and Randomness
Representation of left-computable ε-random reals
Journal of Computer and System Sciences
Compression of individual sequences via variable-rate coding
IEEE Transactions on Information Theory
Invariance and universality of complexity
WTCS'12 Proceedings of the 2012 international conference on Theoretical Computer Science: computation, physics and beyond
State complexity of kleene-star operations on trees
WTCS'12 Proceedings of the 2012 international conference on Theoretical Computer Science: computation, physics and beyond
Impugning Randomness, Convincingly
Studia Logica
| Hi-index | 5.23 |
In this paper we develop a version of Algorithmic Information Theory (AIT) based on finite transducers instead of Turing machines; the complexity induced is called finite-state complexity. In spite of the fact that the Universality Theorem (true for Turing machines) is false for finite transducers, the Invariance Theorem holds true for finite-state complexity. We construct a class of finite-state complexities based on various enumerations of the set of finite transducers. In contrast with descriptional complexities (plain, prefix-free) from AIT, finite-state complexity is computable and there is no a priori upper bound for the number of states used for minimal descriptions of arbitrary strings. Upper and lower bounds for the finite-state complexity of arbitrary strings, and for strings of particular types, are given and incompressible strings are studied.