Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > cs > arXiv:2510.17544

Help | Advanced Search

Computer Science > Information Theory

arXiv:2510.17544 (cs)
[Submitted on 20 Oct 2025 ]

Title: Multihead Finite-State Compression

Title: 多头有限状态压缩

Authors:Neil Lutz
Abstract: This paper develops multihead finite-state compression, a generalization of finite-state compression, complementary to the multihead finite-state dimensions of Huang, Li, Lutz, and Lutz (2025). In this model, an infinite sequence of symbols is compressed by a compressor that produces outputs according to finite-state rules, based on the symbols read by a constant number of finite-state read heads moving forward obliviously through the sequence. The main theorem of this work establishes that for every sequence and every positive integer $h$, the infimum of the compression ratios achieved by $h$-head finite-state information-lossless compressors equals the $h$-head finite-state predimension of the sequence. As an immediate corollary, the infimum of these ratios over all $h$ is the multihead finite-state dimension of the sequence.
Abstract: 本文开发了多头有限状态压缩,这是有限状态压缩的一种推广,与Huang、Li、Lutz和Lutz(2025)提出的多头有限状态维度相辅相成。 在这个模型中,一个无限符号序列通过一个压缩器进行压缩,该压缩器根据有限状态规则生成输出,这些规则基于固定数量的有限状态读头在序列中向前无记忆地读取符号。 本研究的主要定理表明,对于每个序列和每个正整数$h$,由$h$-头有限状态无损压缩器实现的压缩比的下确界等于该序列的$h$-头有限状态预维数。 作为直接推论,所有$h$的这些比值的下确界是该序列的多头有限状态维数。
Subjects: Information Theory (cs.IT) ; Formal Languages and Automata Theory (cs.FL)
Cite as: arXiv:2510.17544 [cs.IT]
  (or arXiv:2510.17544v1 [cs.IT] for this version)
  https://doi.org/10.48550/arXiv.2510.17544
arXiv-issued DOI via DataCite

Submission history

From: Neil Lutz [view email]
[v1] Mon, 20 Oct 2025 13:53:47 UTC (13 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
view license
Current browse context:
cs
< prev   |   next >
new | recent | 2025-10
Change to browse by:
cs.FL
cs.IT
math
math.IT

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号