scientific article; zbMATH DE number 1747450
From MaRDI portal
Publication:4531381
zbMath1004.68077MaRDI QIDQ4531381
Wang, Ming-wei, Jeffrey O. Shallit
Publication date: 29 May 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (16)
Automatic Kolmogorov complexity, normality, and finite-state dimension revisited ⋮ Kolmogorov Structure Functions for Automatic Complexity in Computational Statistics ⋮ Algorithmic introduction of quantified cuts ⋮ Kolmogorov structure functions for automatic complexity ⋮ On the complexity of automatic complexity ⋮ A linearly computable measure of string complexity ⋮ The Complexity of Complexity ⋮ Automatic complexity of Fibonacci and tribonacci words ⋮ Nondeterministic automatic complexity of overlap-free and almost square-free words ⋮ An incompressibility theorem for automatic complexity ⋮ Finite state complexity ⋮ Automatic complexity of shift register sequences ⋮ Finite-state independence ⋮ VC-dimensions of nondeterministic finite automata for words of equal length ⋮ Compressibility of Finite Languages by Grammars ⋮ Simulating finite automata with context-free grammars.
This page was built for publication: