arXiv - CS - Formal Languages and Automata Theory最新文献_第7页

On Transition Constructions for Automata -- A Categorical Perspective 论自动机的转换构造 -- 分类视角

arXiv - CS - Formal Languages and Automata Theory Pub Date : 2024-06-27 DOI: arxiv-2406.19312

Mike Cruchten

引用次数: 0

The single-use restriction for register automata and transducers over infinite alphabets 无限字母表上寄存器自动机和转换器的单次使用限制

arXiv - CS - Formal Languages and Automata Theory Pub Date : 2024-06-27 DOI: arxiv-2406.18934

Rafał Stefański

{"title":"The single-use restriction for register automata and transducers over infinite alphabets","authors":"Rafał Stefański","doi":"arxiv-2406.18934","DOIUrl":"https://doi.org/arxiv-2406.18934","url":null,"abstract":"This thesis studies the single-use restriction for register automata and\u0000transducers over infinite alphabets. The restriction requires that a\u0000read-access to a register should have the side effect of destroying its\u0000contents. This constraint results in robust classes of languages and\u0000transductions. For automata models, we show that one-way register automata,\u0000two-way register automata, and orbit-finite monoids have the same expressive\u0000power. For transducer models, we show that single-use Mealy machines and\u0000single-use two-way transducers admit versions of the Krohn-Rhodes decomposition\u0000theorem. Moreover, single-use Mealy machines are equivalent to an algebraic\u0000model called local algebraic semigroup transductions. Additionally, we show\u0000that single-use two-way transducers are equivalent to single-use streaming\u0000string transducers (SSTs) over infinite alphabets and to regular list functions\u0000with atoms. Compared with the previous work arXiv:1907.10504, this thesis offers a\u0000coherent narrative on the single-use restriction. We introduce an abstract\u0000notion of single-use functions and use them to define all the discussed\u0000single-use models. We also introduce and study the algebraic models of local\u0000semigroup transduction and local rational semigroup transduction.","PeriodicalId":501124,"journal":{"name":"arXiv - CS - Formal Languages and Automata Theory","volume":"26 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141511254","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

PDFA Distillation via String Probability Queries {PDFA Distillation via String Probability Queries} 通过字符串概率查询进行 PDFA 提炼 {通过字符串概率查询进行 PDFA 提炼}.

arXiv - CS - Formal Languages and Automata Theory Pub Date : 2024-06-26 DOI: arxiv-2406.18328

Robert Baumgartner, Sicco Verwer

引用次数: 0

Unveiling the connection between the Lyndon factorization and the Canonical Inverse Lyndon factorization via a border property 通过边界属性揭示林登因式分解与卡农反林登因式分解之间的联系

arXiv - CS - Formal Languages and Automata Theory Pub Date : 2024-06-26 DOI: arxiv-2406.18473

Paola Bonizzoni, Clelia De Felice, Brian Riccardi, Rocco Zaccagnino, Rosalba Zizza

{"title":"Unveiling the connection between the Lyndon factorization and the Canonical Inverse Lyndon factorization via a border property","authors":"Paola Bonizzoni, Clelia De Felice, Brian Riccardi, Rocco Zaccagnino, Rosalba Zizza","doi":"arxiv-2406.18473","DOIUrl":"https://doi.org/arxiv-2406.18473","url":null,"abstract":"The notion of Lyndon word and Lyndon factorization has shown to have\u0000unexpected applications in theory as well in developing novel algorithms on\u0000words. A counterpart to these notions are those of inverse Lyndon word and\u0000inverse Lyndon factorization. Differently from the Lyndon words, the inverse\u0000Lyndon words may be bordered. The relationship between the two factorizations\u0000is related to the inverse lexicographic ordering, and has only been recently\u0000explored. More precisely, a main open question is how to get an inverse Lyndon\u0000factorization from a classical Lyndon factorization under the inverse\u0000lexicographic ordering, named CFLin. In this paper we reveal a strong\u0000connection between these two factorizations where the border plays a relevant\u0000role. More precisely, we show two main results. We say that a factorization has\u0000the border property if a nonempty border of a factor cannot be a prefix of the\u0000next factor. First we show that there exists a unique inverse Lyndon\u0000factorization having the border property. Then we show that this unique\u0000factorization with the border property is the so-called canonical inverse\u0000Lyndon factorization, named ICFL. By showing that ICFL is obtained by\u0000compacting factors of the Lyndon factorization over the inverse lexicographic\u0000ordering, we provide a linear time algorithm for computing ICFL from CFLin.","PeriodicalId":501124,"journal":{"name":"arXiv - CS - Formal Languages and Automata Theory","volume":"20 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141511262","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Self-descriptive Sequences directed by two Periodic Sequences 由两个周期序列引导的自述序列

arXiv - CS - Formal Languages and Automata Theory Pub Date : 2024-06-24 DOI: arxiv-2406.16391

Shigeki AkiyamaInstitute of Mathematics, University of Tsukub, Damien JametUniv. Lorraine, Loria, UMR 7503, Irène MarcoviciUniv Rouen Normandie, CNRS, Normandie Univ LMRS UMR 6085, Mai-Linh Trân-CôngEcole Normale Supérieure de Lyon

引用次数: 0

Counting Polyominoes in a Rectangle b x h 计算矩形 b x h 中的多面体

arXiv - CS - Formal Languages and Automata Theory Pub Date : 2024-06-24 DOI: arxiv-2406.16413

Louis MarinUQAM LACIM

引用次数: 0

Construction of Minkowski Sums by Cellular Automata 用细胞自动机构建闵科夫斯基和

arXiv - CS - Formal Languages and Automata Theory Pub Date : 2024-06-24 DOI: arxiv-2406.16419

Pierre-Adrien TahayLoria, Université de Lorraine

引用次数: 0

Global One-Counter Tree Automata 全局单计数树自动机

arXiv - CS - Formal Languages and Automata Theory Pub Date : 2024-06-21 DOI: arxiv-2406.15090

Luisa Herrmann, Richard Mörbitz

引用次数: 0

Computational Model for Parsing Expression Grammars 解析表达式语法的计算模型

arXiv - CS - Formal Languages and Automata Theory Pub Date : 2024-06-21 DOI: arxiv-2406.14911

Alexander Rubtsov, Nikita Chudinov

{"title":"Computational Model for Parsing Expression Grammars","authors":"Alexander Rubtsov, Nikita Chudinov","doi":"arxiv-2406.14911","DOIUrl":"https://doi.org/arxiv-2406.14911","url":null,"abstract":"We present a computational model for Parsing Expression Grammars (PEGs). The\u0000predecessor of PEGs top-down parsing languages (TDPLs) were discovered by A.\u0000Birman and J. Ullman in the 1960-s, B. Ford showed in 2004 that both formalisms\u0000recognize the same class named Parsing Expression Languages (PELs). A. Birman\u0000and J. Ullman established such important properties like TDPLs generate any\u0000DCFL and some non-context-free languages like $a^nb^nc^n$, a linear-time\u0000parsing algorithm was constructed as well. But since this parsing algorithm was\u0000impractical in the 60-s TDPLs were abandoned and then upgraded by B. Ford to\u0000PEGs, so the parsing algorithm was improved (from the practical point of view)\u0000as well. Now PEGs are actively used in compilers (eg., Python replaced\u0000LL(1)-parser with a PEG one) so as for text processing as well. In this paper,\u0000we present a computational model for PEG, obtain structural properties of PELs,\u0000namely proof that PELs are closed over left concatenation with Boolean closure\u0000of regular closure of DCFLs, and present an extension of the PELs class based\u0000on the extension of our computational model. Our model is an upgrade of\u0000deterministic pushdown automata (DPDA) such that during the pop of a symbol it\u0000is allowed to return the head to the position of the push of the symbol. We\u0000provide a linear-time simulation algorithm for the 2-way version of this model,\u0000which is similar to the S. Cook famous linear-time simulation algorithm of\u00002-way DPDA.","PeriodicalId":501124,"journal":{"name":"arXiv - CS - Formal Languages and Automata Theory","volume":"178 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141511268","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Information-flow Interfaces and Security Lattices 信息流接口和安全网格

arXiv - CS - Formal Languages and Automata Theory Pub Date : 2024-06-20 DOI: arxiv-2406.14374

Ezio Bartocci, Thomas A. Henzinger, Dejan Nickovic, Ana Oliveira da Costa

引用次数: 0