Chrome Extension
WeChat Mini Program
Use on ChatGLM

String Compression in FA-presentable Structures.

Theoretical Computer Science(2023)CCF BSCI 4区

Mahidol Univ | Natl Univ Singapore | Univ Elect Sci & Technol China

Cited 0|Views68
Abstract
We construct a FA–presentation ψ:L→N of the structure (N;S) for which a numerical characteristic r(n) defined as the maximum number ψ(w) for all strings w∈L of length less than or equal to n grows faster than any tower of exponents of a fixed height. This result leads us to a more general notion of a compressibility rate defined for FA–presentations of any FA–presentable structure. We show the existence of FA–presentations for the configuration space of a Turing machine and Cayley graphs of some groups for which it grows faster than any tower of exponents of a fixed height. For FA–presentations of the Presburger arithmetic (N;+) we show that it is bounded from above by a linear function.
More
Translated text
Key words
FA–presentation,FA–presentable structure,Successor function,Presburger arithmetic,Compressibility rate
PDF
Bibtex
AI Read Science
AI Summary
AI Summary is the key point extracted automatically understanding the full text of the paper, including the background, methods, results, conclusions, icons and other key content, so that you can get the outline of the paper at a glance.
Example
Background
Key content
Introduction
Methods
Results
Related work
Fund
Key content
  • Pretraining has recently greatly promoted the development of natural language processing (NLP)
  • We show that M6 outperforms the baselines in multimodal downstream tasks, and the large M6 with 10 parameters can reach a better performance
  • We propose a method called M6 that is able to process information of multiple modalities and perform both single-modal and cross-modal understanding and generation
  • The model is scaled to large model with 10 billion parameters with sophisticated deployment, and the 10 -parameter M6-large is the largest pretrained model in Chinese
  • Experimental results show that our proposed M6 outperforms the baseline in a number of downstream tasks concerning both single modality and multiple modalities We will continue the pretraining of extremely large models by increasing data to explore the limit of its performance
Try using models to generate summary,it takes about 60s
Must-Reading Tree
Example
Generate MRT to find the research sequence of this paper
Related Papers
Data Disclaimer
The page data are from open Internet sources, cooperative publishers and automatic analysis results through AI technology. We do not make any commitments and guarantees for the validity, accuracy, correctness, reliability, completeness and timeliness of the page data. If you have any questions, please contact us by email: report@aminer.cn
Chat Paper

要点】:论文提出了一种新的有限自动机表示方法,证明了某些结构的数值特性增长速度超过固定高度指数塔,并引入了一种新的压缩率概念,进一步研究了不同结构的压缩特性。

方法】:通过构造有限自动机表示(FA-presentation)ψ:L→N,定义了数值特性r(n),并基于此特性提出了压缩率的概念。

实验】:论文未提供具体实验细节,但通过理论分析证明了对于图灵机的配置空间和某些群组的凯莱图,以及普雷格尔算术(N;+),其压缩率具有不同的增长特性,其中普雷格尔算术的压缩率被证明上限为线性函数。未提及具体数据集名称。