Clemens Heuberger , Daniel Krenn , Gabriel F. Lipnik
{"title":"A note on the relation between recognisable series and regular sequences, and their minimal linear representations","authors":"Clemens Heuberger , Daniel Krenn , Gabriel F. Lipnik","doi":"10.1016/j.jsc.2023.102295","DOIUrl":null,"url":null,"abstract":"<div><p>In this note, we precisely elaborate the connection between recognisable series (in the sense of Berstel and Reutenauer) and <em>q</em>-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 <em>q</em>-regular sequences.</p></div>","PeriodicalId":50031,"journal":{"name":"Journal of Symbolic Computation","volume":null,"pages":null},"PeriodicalIF":0.6000,"publicationDate":"2023-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0747717123001098/pdfft?md5=492907babc8de19f0ee8ae11896722d4&pid=1-s2.0-S0747717123001098-main.pdf","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Symbolic Computation","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0747717123001098","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0
Abstract
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.
期刊介绍:
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.