首页 > 最新文献

Acta Informatica最新文献

英文 中文
Alternating complexity of counting first-order logic for the subword order 子字顺序的一阶逻辑计数的交替复杂性
IF 0.6 4区 计算机科学 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2022-06-26 DOI: 10.1007/s00236-022-00424-2
Dietrich Kuske, Christian Schwarz

This paper considers the structure consisting of the set of all words over a given alphabet together with the subword relation, regular predicates, and constants for every word. We are interested in the counting extension of first-order logic by threshold counting quantifiers. The main result shows that the two-variable fragment of this logic can be decided in twofold exponential alternating time with linearly many alternations (and therefore in particular in twofold exponential space as announced in the conference version (Kuske and Schwarz, in: MFCS’20, Leibniz International Proceedings in Informatics (LIPIcs) vol. 170, pp 56:1–56:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020) of this paper) provided the regular predicates are restricted to piecewise testable ones. This result improves prior insights by Karandikar and Schnoebelen by extending the logic and saving one exponent in the space bound. Its proof consists of two main parts: First, we provide a quantifier elimination procedure that results in a formula with constants of bounded length (this generalises the procedure by Karandikar and Schnoebelen for first-order logic). From this, it follows that quantification in formulas can be restricted to words of bounded length, i.e., the second part of the proof is an adaptation of the method by Ferrante and Rackoff to counting logic and deviates significantly from the path of reasoning by Karandikar and Schnoebelen.

本文考虑了由给定字母表上所有单词的集合以及每个单词的子词关系、规则谓词和常量组成的结构。我们感兴趣的是通过阈值计数量词对一阶逻辑的计数扩展。主要结果表明,该逻辑的双变量片段可以在具有线性多变化的双指数交替时间中确定(因此特别是在会议版本中宣布的双指数空间中)(Kuske和Schwarz, in: MFCS ' 20, Leibniz International Proceedings in Informatics (LIPIcs) vol. 170, pp 56:1-56:13)。Schloss Dagstuhl - Leibniz-Zentrum fr Informatik, 2020)提供了正则谓词限制为分段可测试的谓词。这个结果改进了Karandikar和Schnoebelen先前的见解,扩展了逻辑并在空间界中节省了一个指数。它的证明由两个主要部分组成:首先,我们提供了一个量词消去过程,得到一个有界长度常数的公式(这推广了Karandikar和Schnoebelen在一阶逻辑中的过程)。由此可以得出,公式中的量化可以被限制在有界长度的词中,即证明的第二部分是Ferrante和Rackoff对计数逻辑方法的改编,明显偏离了Karandikar和Schnoebelen的推理路径。
{"title":"Alternating complexity of counting first-order logic for the subword order","authors":"Dietrich Kuske,&nbsp;Christian Schwarz","doi":"10.1007/s00236-022-00424-2","DOIUrl":"10.1007/s00236-022-00424-2","url":null,"abstract":"<div><p>This paper considers the structure consisting of the set of all words over a given alphabet together with the subword relation, regular predicates, and constants for every word. We are interested in the counting extension of first-order logic by threshold counting quantifiers. The main result shows that the two-variable fragment of this logic can be decided in twofold exponential alternating time with linearly many alternations (and therefore in particular in twofold exponential space as announced in the conference version (Kuske and Schwarz, in: MFCS’20, Leibniz International Proceedings in Informatics (LIPIcs) vol. 170, pp 56:1–56:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020) of this paper) provided the regular predicates are restricted to piecewise testable ones. This result improves prior insights by Karandikar and Schnoebelen by extending the logic and saving one exponent in the space bound. Its proof consists of two main parts: First, we provide a quantifier elimination procedure that results in a formula with constants of bounded length (this generalises the procedure by Karandikar and Schnoebelen for first-order logic). From this, it follows that quantification in formulas can be restricted to words of bounded length, i.e., the second part of the proof is an adaptation of the method by Ferrante and Rackoff to counting logic and deviates significantly from the path of reasoning by Karandikar and Schnoebelen.</p></div>","PeriodicalId":7189,"journal":{"name":"Acta Informatica","volume":"60 1","pages":"79 - 100"},"PeriodicalIF":0.6,"publicationDate":"2022-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s00236-022-00424-2.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42991457","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Lamplighter groups and automata 点灯组和自动机
IF 0.6 4区 计算机科学 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2022-06-08 DOI: 10.1007/s00236-022-00423-3
Sanjay Jain, Birzhan Moldagaliyev, F. Stephan, Tien Dat Tran
{"title":"Lamplighter groups and automata","authors":"Sanjay Jain, Birzhan Moldagaliyev, F. Stephan, Tien Dat Tran","doi":"10.1007/s00236-022-00423-3","DOIUrl":"https://doi.org/10.1007/s00236-022-00423-3","url":null,"abstract":"","PeriodicalId":7189,"journal":{"name":"Acta Informatica","volume":"59 1","pages":"451 - 478"},"PeriodicalIF":0.6,"publicationDate":"2022-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"52289547","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Lamplighter groups and automata 点灯组和自动机
IF 0.6 4区 计算机科学 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2022-06-08 DOI: 10.1007/s00236-022-00423-3
Sanjay Jain, Birzhan Moldagaliyev, Frank Stephan, Tien Dat Tran

This paper investigates presentations of lamplighter groups using computational models from automata theory. The present work shows that if G can be presented such that the full group operation is recognised by a transducer, then the same is true for the lamplighter group (G wr {{mathbb {Z}}}) of G. Furthermore, Cayley presentations, where only multiplications with constants are recognised by transducers, are used to study generalised lamplighter groups of the form (G wr {{mathbb {Z}}}^d) and (G wr F_d), where (F_d) is the free group over d generators. Additionally, ({{mathbb {Z}}}_k wr {{mathbb {Z}}}^2) and ({{mathbb {Z}}}_k wr {F_d}) are shown to be Cayley tree automatic.

本文利用自动机理论的计算模型研究了点灯组的表示。目前的工作表明,如果G可以被呈现,使得整个群操作被换能器识别,那么G的点灯群(G wr {{mathbb {Z}}})也是如此。此外,Cayley表示,其中只有带有常数的乘法被换能器识别,用于研究形式为(G wr {{mathbb {Z}}}^d)和(G wr F_d)的广义点灯群,其中(F_d)是d个发生器上的自由群。此外,({{mathbb {Z}}}_k wr {{mathbb {Z}}}^2)和({{mathbb {Z}}}_k wr {F_d})显示为Cayley树自动。
{"title":"Lamplighter groups and automata","authors":"Sanjay Jain,&nbsp;Birzhan Moldagaliyev,&nbsp;Frank Stephan,&nbsp;Tien Dat Tran","doi":"10.1007/s00236-022-00423-3","DOIUrl":"10.1007/s00236-022-00423-3","url":null,"abstract":"<div><p>This paper investigates presentations of lamplighter groups using computational models from automata theory. The present work shows that if <i>G</i> can be presented such that the full group operation is recognised by a transducer, then the same is true for the lamplighter group <span>(G wr {{mathbb {Z}}})</span> of <i>G</i>. Furthermore, Cayley presentations, where only multiplications with constants are recognised by transducers, are used to study generalised lamplighter groups of the form <span>(G wr {{mathbb {Z}}}^d)</span> and <span>(G wr F_d)</span>, where <span>(F_d)</span> is the free group over <i>d</i> generators. Additionally, <span>({{mathbb {Z}}}_k wr {{mathbb {Z}}}^2)</span> and <span>({{mathbb {Z}}}_k wr {F_d})</span> are shown to be Cayley tree automatic.</p></div>","PeriodicalId":7189,"journal":{"name":"Acta Informatica","volume":"59 4","pages":"451 - 478"},"PeriodicalIF":0.6,"publicationDate":"2022-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"50014521","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Depth-first search in directed planar graphs, revisited 有向平面图中的深度优先搜索,重访
IF 0.6 4区 计算机科学 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2022-06-04 DOI: 10.1007/s00236-022-00425-1
Eric Allender, Archit Chauhan, Samir Datta

We present an algorithm for constructing a depth-first search tree in planar digraphs; the algorithm can be implemented in the complexity class (text{ AC}^1(text{ UL }cap text{ co-UL})), which is contained in (text{ AC}^2). Prior to this (for more than a quarter-century), the fastest uniform deterministic parallel algorithm for this problem had a runtime of (O(log ^{10}n)) (corresponding to the complexity class (text{ AC}^{10}subseteq text{ NC}^{11})). We also consider the problem of computing depth-first search trees in other classes of graphs and obtain additional new upper bounds.

提出了一种构造平面有向图中深度优先搜索树的算法;该算法可以在复杂度类(text{ AC}^1(text{ UL }cap text{ co-UL}))中实现,该复杂度类包含在(text{ AC}^2)中。在此之前(超过四分之一个世纪),这个问题最快的统一确定性并行算法的运行时为(O(log ^{10}n))(对应于复杂度类(text{ AC}^{10}subseteq text{ NC}^{11}))。我们还考虑了在其他类型的图中计算深度优先搜索树的问题,并获得了新的上界。
{"title":"Depth-first search in directed planar graphs, revisited","authors":"Eric Allender,&nbsp;Archit Chauhan,&nbsp;Samir Datta","doi":"10.1007/s00236-022-00425-1","DOIUrl":"10.1007/s00236-022-00425-1","url":null,"abstract":"<div><p>We present an algorithm for constructing a depth-first search tree in planar digraphs; the algorithm can be implemented in the complexity class <span>(text{ AC}^1(text{ UL }cap text{ co-UL}))</span>, which is contained in <span>(text{ AC}^2)</span>. Prior to this (for more than a quarter-century), the fastest uniform deterministic parallel algorithm for this problem had a runtime of <span>(O(log ^{10}n))</span> (corresponding to the complexity class <span>(text{ AC}^{10}subseteq text{ NC}^{11})</span>). We also consider the problem of computing depth-first search trees in other classes of graphs and obtain additional new upper bounds.\u0000</p></div>","PeriodicalId":7189,"journal":{"name":"Acta Informatica","volume":"59 4","pages":"289 - 319"},"PeriodicalIF":0.6,"publicationDate":"2022-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45032441","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Secret-shared RAM indefinite private and secure RAM execution of perfectly unrevealed programs 秘密共享RAM完全未公开程序的无限私人和安全RAM执行
IF 0.6 4区 计算机科学 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2022-04-20 DOI: 10.1007/s00236-022-00422-4
Shlomi Dolev, Yin Li

Secure and private computations over random access machine (RAM) are preferred over computations with circuits or Turing machines. Secure RAM executions become more and more important in the scope of avoiding information leakage when executing programs over a single computer, as well as the clouds. In this paper, we proposed a novel scheme for evaluating RAM programs without revealing any information on the computation, including the program, the data, and the result. We use Shamir Secret Sharing to share all the program instructions and the private string matching technique to ensure the execution of the right instruction sequence. We stress that our scheme obtains information-theoretical security and does not rely on any computational hardness assumptions.

随机存取机(RAM)上的安全和私有计算优于电路或图灵机的计算。在单台计算机和云上执行程序时,为了避免信息泄漏,安全RAM执行变得越来越重要。在本文中,我们提出了一种新的方案来评估RAM程序,而不透露任何有关计算的信息,包括程序,数据和结果。我们使用Shamir秘密共享来共享所有的程序指令,并使用私有字符串匹配技术来确保正确的指令序列的执行。我们强调,我们的方案获得信息理论上的安全性,不依赖于任何计算硬度假设。
{"title":"Secret-shared RAM indefinite private and secure RAM execution of perfectly unrevealed programs","authors":"Shlomi Dolev,&nbsp;Yin Li","doi":"10.1007/s00236-022-00422-4","DOIUrl":"10.1007/s00236-022-00422-4","url":null,"abstract":"<div><p>Secure and private computations over random access machine (RAM) are preferred over computations with circuits or Turing machines. Secure RAM executions become more and more important in the scope of avoiding information leakage when executing programs over a single computer, as well as the clouds. In this paper, we proposed a novel scheme for evaluating RAM programs without revealing any information on the computation, including the program, the data, and the result. We use Shamir Secret Sharing to share all the program instructions and the private string matching technique to ensure the execution of the right instruction sequence. We stress that our scheme obtains information-theoretical security and does not rely on any computational hardness assumptions.</p></div>","PeriodicalId":7189,"journal":{"name":"Acta Informatica","volume":"60 1","pages":"59 - 78"},"PeriodicalIF":0.6,"publicationDate":"2022-04-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s00236-022-00422-4.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46502702","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Reactive bisimulation semantics for a process algebra with timeouts 带有超时的进程代数的响应式双模拟语义
IF 0.6 4区 计算机科学 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2022-04-08 DOI: 10.1007/s00236-022-00417-1
Rob van Glabbeek

This paper introduces the counterpart of strong bisimilarity for labelled transition systems extended with timeout transitions. It supports this concept through a modal characterisation, congruence results for a standard process algebra with recursion, and a complete axiomatisation.

本文介绍了带超时过渡扩展的标记过渡系统的强双相似对应。它通过模态刻画、递归过程代数的同余结果和完全公理化来支持这一概念。
{"title":"Reactive bisimulation semantics for a process algebra with timeouts","authors":"Rob van Glabbeek","doi":"10.1007/s00236-022-00417-1","DOIUrl":"10.1007/s00236-022-00417-1","url":null,"abstract":"<div><p>This paper introduces the counterpart of strong bisimilarity for labelled transition systems extended with timeout transitions. It supports this concept through a modal characterisation, congruence results for a standard process algebra with recursion, and a complete axiomatisation.</p></div>","PeriodicalId":7189,"journal":{"name":"Acta Informatica","volume":"60 1","pages":"11 - 57"},"PeriodicalIF":0.6,"publicationDate":"2022-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s00236-022-00417-1.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47949564","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Translation validation of coloured Petri net models of programs on integers 整数上程序的彩色Petri网模型的翻译验证
IF 0.6 4区 计算机科学 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2022-04-06 DOI: 10.1007/s00236-022-00419-z
Soumyadip Bandyopadhyay, Dipankar Sarkar, Chittaranjan Mandal, Holger Giese

Programs are often subjected to significant optimizing and parallelizing transformations based on extensive dependence analysis. Formal validation of such transformations needs modelling paradigms which can capture both control and data dependences in the program vividly. Being value-based with an inherent scope of capturing parallelism, the untimed coloured Petri net (CPN) models, reported in the literature, fit the bill well; accordingly, they are likely to be more convenient as the intermediate representations (IRs) of both the source and the transformed codes for translation validation than strictly sequential variable-based IRs like sequential control flow graphs (CFGs). In this work, an efficient path-based equivalence checking method for CPN models of programs on integers is presented. Extensive experimentation has been carried out on several sequential and parallel examples. Complexity and correctness issues have been treated rigorously for the method.

基于广泛的依赖性分析,程序经常需要进行重要的优化和并行化转换。这种转换的形式化验证需要建模范例,它可以生动地捕获程序中的控制和数据依赖关系。文献中报道的非定时彩色Petri网(CPN)模型是基于捕获并行性的固有范围的值,很好地符合要求;因此,作为源代码和转换后的代码的中间表示(ir),它们可能比严格顺序的基于变量的ir(如顺序控制流图(cfg))更方便用于翻译验证。本文提出了一种有效的基于路径的整数规划CPN模型等价性检验方法。在几个顺序和并行的例子上进行了大量的实验。该方法严格处理了复杂性和正确性问题。
{"title":"Translation validation of coloured Petri net models of programs on integers","authors":"Soumyadip Bandyopadhyay,&nbsp;Dipankar Sarkar,&nbsp;Chittaranjan Mandal,&nbsp;Holger Giese","doi":"10.1007/s00236-022-00419-z","DOIUrl":"10.1007/s00236-022-00419-z","url":null,"abstract":"<div><p>Programs are often subjected to significant optimizing and parallelizing transformations based on extensive dependence analysis. Formal validation of such transformations needs modelling paradigms which can capture both control and data dependences in the program vividly. Being value-based with an inherent scope of capturing parallelism, the untimed coloured Petri net (CPN) models, reported in the literature, fit the bill well; accordingly, they are likely to be more convenient as the intermediate representations (IRs) of both the source and the transformed codes for translation validation than strictly sequential variable-based IRs like sequential control flow graphs (CFGs). In this work, an <i>efficient</i> path-based equivalence checking method for CPN models of programs on integers is presented. Extensive experimentation has been carried out on several sequential and parallel examples. Complexity and correctness issues have been treated rigorously for the method.</p></div>","PeriodicalId":7189,"journal":{"name":"Acta Informatica","volume":"59 6","pages":"725 - 759"},"PeriodicalIF":0.6,"publicationDate":"2022-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s00236-022-00419-z.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42594701","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
From regular expression matching to parsing 从正则表达式匹配到解析
IF 0.6 4区 计算机科学 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2022-03-30 DOI: 10.1007/s00236-022-00420-6
Philip Bille, Inge Li Gørtz

Given a regular expression R and a string Q, the regular expression parsing problem is to determine if Q matches R and if so, determine how it matches, i.e., by a mapping of the characters of Q to the characters in R. Regular expression parsing makes finding matches of a regular expression even more useful by allowing us to directly extract subpatterns of the match, e.g., for extracting IP-addresses from internet traffic analysis or extracting subparts of genomes from genetic data bases. We present a new general techniques for efficiently converting a large class of algorithms that determine if a string Q matches regular expression R into algorithms that can construct a corresponding mapping. As a consequence, we obtain the first efficient linear space solutions for regular expression parsing.

给定正则表达式R和一个字符串Q,正则表达式解析问题是确定如果Q R和匹配如果是,确定如何匹配,也就是说,一个映射的字符问的字符在R .正则表达式解析找到匹配的正则表达式更有用让我们直接提取的子模式匹配,例如,从互联网流量中提取ip地址的分析或提取部分基因组的基因数据基地。我们提出了一种新的通用技术,用于有效地将一大类确定字符串Q是否与正则表达式R匹配的算法转换为可以构造相应映射的算法。因此,我们获得了正则表达式解析的第一个有效的线性空间解。
{"title":"From regular expression matching to parsing","authors":"Philip Bille,&nbsp;Inge Li Gørtz","doi":"10.1007/s00236-022-00420-6","DOIUrl":"10.1007/s00236-022-00420-6","url":null,"abstract":"<div><p>Given a regular expression <i>R</i> and a string <i>Q</i>, the regular expression parsing problem is to determine if <i>Q</i> matches <i>R</i> and if so, determine how it matches, i.e., by a mapping of the characters of <i>Q</i> to the characters in <i>R</i>. Regular expression parsing makes finding matches of a regular expression even more useful by allowing us to directly extract subpatterns of the match, e.g., for extracting IP-addresses from internet traffic analysis or extracting subparts of genomes from genetic data bases. We present a new general techniques for efficiently converting a large class of algorithms that determine if a string <i>Q</i> matches regular expression <i>R</i> into algorithms that can construct a corresponding mapping. As a consequence, we obtain the first efficient linear space solutions for regular expression parsing.</p></div>","PeriodicalId":7189,"journal":{"name":"Acta Informatica","volume":"59 6","pages":"709 - 724"},"PeriodicalIF":0.6,"publicationDate":"2022-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44390261","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
(mathcal {L})-reduction computation revisited 重新讨论(mathcal{L})-归约计算
IF 0.6 4区 计算机科学 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2022-03-24 DOI: 10.1007/s00236-022-00418-0
Kaoru Fujioka, Fumiya Okubo, Takashi Yokomori

Let K and L be two languages over (Sigma ) and (Gamma ) (with (Gamma subset Sigma )), respectively. Then, the L-reduction of K, denoted by (K%,L), is defined by ({ u_0u_1cdots u_n in (Sigma - Gamma )^* mid u_0v_1u_1 cdots v_nu_n in K, v_i in L (1le i le n) }). This is extended to language classes as follows: ({mathcal {K}}% {mathcal {L}}={K%L mid K in {mathcal {K}}, , L in {mathcal {L}} }). In this paper, we investigate the computing powers of (mathcal {K}%,mathcal {L}) in which (mathcal {K}) ranges among various classes of (mathcal {INS}^i_{!!j}) and min-(mathcal {LIN}), while (mathcal {L}) is taken as (mathcal {DYCK}) and (mathcal {F}), where (mathcal {INS}^i_{!!j}): the class of insertion languages of weight (ji), min-(mathcal {LIN}): the class of minimal linear languages, (mathcal {DYCK}): the class of Dyck languages, and (mathcal {F}): the class of finite languages. The obtained results include:

  • (mathcal {INS}^1_1,%,mathcal {DYCK}=mathcal {RE})

  • (mathcal {INS}^0_i,%,mathcal {F}= mathcal {INS}^1_j,%,mathcal {F}=mathcal {CF}) (for (ige 3) and (jge 1))

  • (mathcal {INS}^0_2,%,mathcal {DYCK}=mathcal {INS}^0_2)

  • min-(mathcal {LIN},%,mathcal {F}_1=mathcal {LIN})

where (mathcal {RE}), (mathcal {CF}), (mathcal {LIN}), (mathcal {F}_1) are classes of recursively enumerable, of context-free, of linear languages, and of singleton languages over unary alphabet, respectively. Further, we provide a very simple alternative proof for the known result min-(mathcal {LIN},%,mathcal {DYCK}_2=mathcal {RE}). We also show that with a certain condition, for the class of context-sensitive languages (mathcal {CS}), there exists no (mathcal {K}) such that (mathcal {K}%,mathcal {DYCK}=mathcal {CS}), which is in marked contrast to the characterization results mentioned above for other classes in Chomsky hierarchy. It should be remarked from the viewpoint of molecular computing theory that the notion of L-reduction is naturally motivated by a molecular biological functioning well-known as RNA splicing occurring in most eukaryotic genes.

设K和L分别是在( Sigma )和( Gamma )上的两种语言(带有(伽玛子集西格玛))。然后,用(K%,L)表示的K的L-归约由({u_0u1cdots u_n in( Sigma-Gamma)^* mid u_0v_1cdots v_n in K, v_i in L(1le ile n)})定义。这被扩展到如下的语言类:({mathcal{K}}%{math cal{L})={K %Lmid Kin{matical{K}},,Lin}mathical{L}}})。在本文中,我们研究了(mathcal{K}%,mathcal{L})的计算能力,其中(matchal{K})范围在(mathical{INS}^i_{!!j})和min-(mathical{LIN},i),min-(mathcal{LIN}):极小线性语言的类,(mathical{DYCK}。所获得的结果包括:(mathcal{INS}^1_1,%,mathcal{DYCK}=mathical{RE})(math cal{INS}^0_i,%,math cal{F}= mathcal{INS}^1_j,%,mathal{F}= mathccal{CF}^0_2)最小-(mathcal{LIN},%,mathcal{F}_1=mathcal{LIN}),其中(mathcal{RE}{F}_1)分别是递归可枚举类、上下文无关类、线性语言类和一元字母表上的单例语言类。此外,我们为已知结果min-(mathcal{LIN},%,mathcal{DYCK}_2=mathcal{RE})。我们还证明,在一定条件下,对于上下文敏感语言类(mathcal{CS}),不存在(math cal{K},mathcal{DYCK}=mathcal}CS}),这与上述Chomsky层次结构中其他类的特征化结果形成了鲜明对比。从分子计算理论的角度来看,L-还原的概念是由大多数真核生物基因中发生的众所周知的RNA剪接的分子生物学功能自然驱动的。
{"title":"(mathcal {L})-reduction computation revisited","authors":"Kaoru Fujioka,&nbsp;Fumiya Okubo,&nbsp;Takashi Yokomori","doi":"10.1007/s00236-022-00418-0","DOIUrl":"10.1007/s00236-022-00418-0","url":null,"abstract":"<div><p>Let <i>K</i> and <i>L</i> be two languages over <span>(Sigma )</span> and <span>(Gamma )</span> (with <span>(Gamma subset Sigma )</span>), respectively. Then, the <i>L</i>-reduction of <i>K</i>, denoted by <span>(K%,L)</span>, is defined by <span>({ u_0u_1cdots u_n in (Sigma - Gamma )^* mid u_0v_1u_1 cdots v_nu_n in K, v_i in L (1le i le n) })</span>. This is extended to language classes as follows: <span>({mathcal {K}}% {mathcal {L}}={K%L mid K in {mathcal {K}}, , L in {mathcal {L}} })</span>. In this paper, we investigate the computing powers of <span>(mathcal {K}%,mathcal {L})</span> in which <span>(mathcal {K})</span> ranges among various classes of <span>(mathcal {INS}^i_{!!j})</span> and min-<span>(mathcal {LIN})</span>, while <span>(mathcal {L})</span> is taken as <span>(mathcal {DYCK})</span> and <span>(mathcal {F})</span>, where <span>(mathcal {INS}^i_{!!j})</span>: the class of insertion languages of weight (<i>j</i>, <i>i</i>), min-<span>(mathcal {LIN})</span>: the class of minimal linear languages, <span>(mathcal {DYCK})</span>: the class of Dyck languages, and <span>(mathcal {F})</span>: the class of finite languages. The obtained results include:</p><ul>\u0000 <li>\u0000 <p><span>(mathcal {INS}^1_1,%,mathcal {DYCK}=mathcal {RE})</span></p>\u0000 </li>\u0000 <li>\u0000 <p><span>(mathcal {INS}^0_i,%,mathcal {F}= mathcal {INS}^1_j,%,mathcal {F}=mathcal {CF})</span> (for <span>(ige 3)</span> and <span>(jge 1)</span>)</p>\u0000 </li>\u0000 <li>\u0000 <p><span>(mathcal {INS}^0_2,%,mathcal {DYCK}=mathcal {INS}^0_2)</span></p>\u0000 </li>\u0000 <li>\u0000 <p>min-<span>(mathcal {LIN},%,mathcal {F}_1=mathcal {LIN})</span></p>\u0000 </li>\u0000 </ul><p> where <span>(mathcal {RE})</span>, <span>(mathcal {CF})</span>, <span>(mathcal {LIN})</span>, <span>(mathcal {F}_1)</span> are classes of recursively enumerable, of context-free, of linear languages, and of singleton languages over unary alphabet, respectively. Further, we provide a very simple alternative proof for the known result min-<span>(mathcal {LIN},%,mathcal {DYCK}_2=mathcal {RE})</span>. We also show that with a certain condition, for the class of context-sensitive languages <span>(mathcal {CS})</span>, there exists no <span>(mathcal {K})</span> such that <span>(mathcal {K}%,mathcal {DYCK}=mathcal {CS})</span>, which is in marked contrast to the characterization results mentioned above for other classes in Chomsky hierarchy. It should be remarked from the viewpoint of molecular computing theory that the notion of <i>L</i>-reduction is naturally motivated by a molecular biological functioning well-known as RNA splicing occurring in most eukaryotic genes.</p></div>","PeriodicalId":7189,"journal":{"name":"Acta Informatica","volume":"59 4","pages":"409 - 426"},"PeriodicalIF":0.6,"publicationDate":"2022-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"50102392","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Ldocumentclass[12pt]{minimal} usepackage{amsmath} usepackage{wasysym} usepackage{amsfonts} usepackage{amssymb} usepackage{amsbsy} usepackage{mathrsfs} usepackage{upgreek} setlength{oddsidemargin}{-69pt} begin{document}$$mathcal {L}$$end{document}-reduction computation revisited Ldocumentclass[12pt]{minimal} usepackage{amsmath} usepackage{wasysym} usepackage{amsfonts} usepackage{amssymb} usepackage{amsbsy} usepackage{mathrsfs} usepackage{upgreek} setlength{oddsidemargin}{-69pt} begin{document}$$mathcal {L}$$end{document}-reduction computation revisited
IF 0.6 4区 计算机科学 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2022-03-24 DOI: 10.1007/s00236-022-00418-0
Kaoru Fujioka, Fumiya Okubo, T. Yokomori
{"title":"Ldocumentclass[12pt]{minimal} usepackage{amsmath} usepackage{wasysym} usepackage{amsfonts} usepackage{amssymb} usepackage{amsbsy} usepackage{mathrsfs} usepackage{upgreek} setlength{oddsidemargin}{-69pt} begin{document}$$mathcal {L}$$end{document}-reduction computation revisited","authors":"Kaoru Fujioka, Fumiya Okubo, T. Yokomori","doi":"10.1007/s00236-022-00418-0","DOIUrl":"https://doi.org/10.1007/s00236-022-00418-0","url":null,"abstract":"","PeriodicalId":7189,"journal":{"name":"Acta Informatica","volume":"59 1","pages":"409 - 426"},"PeriodicalIF":0.6,"publicationDate":"2022-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46875681","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
Acta Informatica
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1