关于可识别数列和正则表达式及其最小线性表示之间关系的说明

IF 0.6 4区数学 Q4 COMPUTER SCIENCE, THEORY & METHODS

Journal of Symbolic Computation Pub Date : 2023-12-28 DOI:10.1016/j.jsc.2023.102295

Clemens Heuberger , Daniel Krenn , Gabriel F. Lipnik

引用次数: 0

摘要

在本论文中，我们通过可识别数列的线性表示，精确阐述了可识别数列（Berstel 和 Reutenauer 意义上的）与 q-regular 序列（Allouche 和 Shallit 意义上的）之间的联系。我们特别指出，可识别数列的最小化算法也可用于最小化 q-regular 序列的线性表示。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A note on the relation between recognisable series and regular sequences, and their minimal linear representations

In this note, we precisely elaborate the connection between recognisable series (in the sense of Berstel and Reutenauer) and q-regular sequences (in the sense of Allouche and Shallit) via their linear representations. In particular, we show that the minimisation algorithm for recognisable series can also be used to minimise linear representations of q-regular sequences.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Journal of Symbolic Computation 工程技术-计算机：理论方法

CiteScore

2.10

自引率

14.30%

发文量

审稿时长

142 days

期刊介绍： An international journal, the Journal of Symbolic Computation, founded by Bruno Buchberger in 1985, is directed to mathematicians and computer scientists who have a particular interest in symbolic computation. The journal provides a forum for research in the algorithmic treatment of all types of symbolic objects: objects in formal languages (terms, formulas, programs); algebraic objects (elements in basic number domains, polynomials, residue classes, etc.); and geometrical objects. It is the explicit goal of the journal to promote the integration of symbolic computation by establishing one common avenue of communication for researchers working in the different subareas. It is also important that the algorithmic achievements of these areas should be made available to the human problem-solver in integrated software systems for symbolic computation. To help this integration, the journal publishes invited tutorial surveys as well as Applications Letters and System Descriptions.