The combinatorial complexity of a finite string

DOI10.1007/3-540-58338-6_83zbMath1493.68165OpenAlexW1526211350MaRDI QIDQ5096895

Valery Kanevsky, Walter W. Kirchherr, Felix Frayman

Publication date: 18 August 2022

Published in: Mathematical Foundations of Computer Science 1994 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-58338-6_83

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Eulerian graphs and related topics. Part 1, Volume 1
• On the Complexity of Finite Sequences

This page was built for publication: The combinatorial complexity of a finite string