发布求助
文献互助 智能选刊 最新文献

Acta Informatica最新文献

筛选
英文 中文
Careful synchronization of partial deterministic finite automata 部分确定性有限自动机的谨慎同步
IF 0.6 4区 计算机科学
Acta Informatica Pub Date : 2022-07-22 DOI: 10.1007/s00236-022-00433-1
Hanan Shabana, M. V. Volkov
{"title":"Careful synchronization of partial deterministic finite automata","authors":"Hanan Shabana,&nbsp;M. V. Volkov","doi":"10.1007/s00236-022-00433-1","DOIUrl":"10.1007/s00236-022-00433-1","url":null,"abstract":"<div><p>We approach the task of computing a carefully synchronizing word of minimum length for a given partial deterministic automaton, encoding the problem as an instance of SAT and invoking a SAT solver. Our experiments demonstrate that this approach gives satisfactory results for automata with up to 100 states even if very modest computational resources are used. We compare our results with the ones obtained by the first author for exact synchronization, which is another version of synchronization studied in the literature, and draw some theoretical conclusions.</p></div>","PeriodicalId":7189,"journal":{"name":"Acta Informatica","volume":"59 4","pages":"479 - 504"},"PeriodicalIF":0.6,"publicationDate":"2022-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"50042538","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
Operational complexity and pumping lemmas 操作复杂性和泵浦引理
IF 0.6 4区 计算机科学
Acta Informatica Pub Date : 2022-07-20 DOI: 10.1007/s00236-022-00431-3
Jürgen Dassow, Ismaël Jecker
{"title":"Operational complexity and pumping lemmas","authors":"Jürgen Dassow,&nbsp;Ismaël Jecker","doi":"10.1007/s00236-022-00431-3","DOIUrl":"10.1007/s00236-022-00431-3","url":null,"abstract":"<div><p>The well-known pumping lemma for regular languages states that, for any regular language <i>L</i>, there is a constant <i>p</i> (depending on <i>L</i>) such that the following holds: If <span>(win L)</span> and <span>(vert wvert ge p)</span>, then there are words <span>(xin V^{*})</span>, <span>(yin V^+)</span>, and <span>(zin V^{*})</span> such that <span>(w=xyz)</span> and <span>(xy^tzin L)</span> for <span>(tge 0)</span>. The minimal pumping constant <span>({{{,mathrm{mpc},}}(L)})</span> of <i>L</i> is the minimal number <i>p</i> for which the conditions of the pumping lemma are satisfied. We investigate the behaviour of <span>({{{,mathrm{mpc},}}})</span> with respect to operations, i. e., for an <i>n</i>-ary regularity preserving operation <span>(circ )</span>, we study the set <span>({g_{circ }^{{{,mathrm{mpc},}}}(k_1,k_2,ldots ,k_n)})</span> of all numbers <i>k</i> such that there are regular languages <span>(L_1,L_2,ldots ,L_n)</span> with <span>({{{,mathrm{mpc},}}(L_i)=k_i})</span> for <span>(1le ile n)</span> and <span>({{{,mathrm{mpc},}}(circ (L_1,L_2,ldots ,L_n)=~k})</span>. With respect to Kleene closure, complement, reversal, prefix and suffix-closure, circular shift, union, intersection, set-subtraction, symmetric difference,and concatenation, we determine <span>({g_{circ }^{{{,mathrm{mpc},}}}(k_1,k_2,ldots ,k_n)})</span> completely. Furthermore, we give some results with respect to the minimal pumping length where, in addition, <span>(vert xyvert le p)</span> has to hold.</p></div>","PeriodicalId":7189,"journal":{"name":"Acta Informatica","volume":"59 4","pages":"337 - 355"},"PeriodicalIF":0.6,"publicationDate":"2022-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s00236-022-00431-3.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43609320","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}
引用次数: 1
Weighted throughput in a single machine preemptive scheduling with continuous controllable processing times 具有连续可控处理时间的单机抢占调度中的加权吞吐量
IF 0.6 4区 计算机科学
Acta Informatica Pub Date : 2022-07-19 DOI: 10.1007/s00236-022-00430-4
Asaf Levin, Tal Shusterman
{"title":"Weighted throughput in a single machine preemptive scheduling with continuous controllable processing times","authors":"Asaf Levin,&nbsp;Tal Shusterman","doi":"10.1007/s00236-022-00430-4","DOIUrl":"10.1007/s00236-022-00430-4","url":null,"abstract":"<div><p>We consider the problem of weighted throughput in the single machine preemptive scheduling with continuous controllable processing times. A set of tasks can be scheduled on a single machine. Each task <i>j</i> is associated with a nonnegative weight <span>(w_{j})</span>, a release date, a due date, and an interval of possible processing times. A task <i>j</i> can either be scheduled with a total processing time <span>(p_j)</span> which is in the given interval, or rejected (not participating in the schedule). The reward for processing <i>j</i> for <span>(p_{j})</span> time units is <span>(w_{j}p_{j})</span>, and we are interested in constructing a feasible preemptive schedule such that the sum of rewards is maximized. We present a dynamic programming algorithm that solves the problem in pseudo-polynomial time and use it to obtain an FPTAS. Afterward, as our main contribution we propose an interesting efficient frontier approach for improved complexity bounds.</p></div>","PeriodicalId":7189,"journal":{"name":"Acta Informatica","volume":"60 2","pages":"101 - 122"},"PeriodicalIF":0.6,"publicationDate":"2022-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44782247","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
Alternating complexity of counting first-order logic for the subword order 子字顺序的一阶逻辑计数的交替复杂性
IF 0.6 4区 计算机科学
Acta Informatica Pub Date : 2022-06-26 DOI: 10.1007/s00236-022-00424-2
Dietrich Kuske, Christian Schwarz
{"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区 计算机科学
Acta Informatica 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区 计算机科学
Acta Informatica Pub Date : 2022-06-08 DOI: 10.1007/s00236-022-00423-3
Sanjay Jain, Birzhan Moldagaliyev, Frank Stephan, Tien Dat Tran
{"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区 计算机科学
Acta Informatica Pub Date : 2022-06-04 DOI: 10.1007/s00236-022-00425-1
Eric Allender, Archit Chauhan, Samir Datta
{"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区 计算机科学
Acta Informatica Pub Date : 2022-04-20 DOI: 10.1007/s00236-022-00422-4
Shlomi Dolev, Yin Li
{"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区 计算机科学
Acta Informatica Pub Date : 2022-04-08 DOI: 10.1007/s00236-022-00417-1
Rob van Glabbeek
{"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区 计算机科学
Acta Informatica Pub Date : 2022-04-06 DOI: 10.1007/s00236-022-00419-z
Soumyadip Bandyopadhyay, Dipankar Sarkar, Chittaranjan Mandal, Holger Giese
{"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
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信