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

Acta Informatica最新文献

筛选
英文 中文
A jumping (5'rightarrow 3') Watson–Crick finite automata model 跳跃(5'rightarrow 3')沃森-克里克有限自动机模型
IF 0.6 4区 计算机科学
Acta Informatica Pub Date : 2022-01-24 DOI: 10.1007/s00236-021-00413-x
Radim Kocman, Zbyněk Křivka, Alexander Meduna, Benedek Nagy
{"title":"A jumping (5'rightarrow 3') Watson–Crick finite automata model","authors":"Radim Kocman,&nbsp;Zbyněk Křivka,&nbsp;Alexander Meduna,&nbsp;Benedek Nagy","doi":"10.1007/s00236-021-00413-x","DOIUrl":"10.1007/s00236-021-00413-x","url":null,"abstract":"<div><p>Jumping finite automata and sensing <span>(5'rightarrow 3')</span> Watson–Crick finite automata are finite-state models of computation which allow to process the input word not only in the strictly left-to-right manner. In this paper a new combined model of them is presented. The accepting power of the new model is studied and compared with the original models and also other well-known language families. Furthermore, the paper investigates changes in the accepting power when commonly studied restrictions from Watson–Crick finite automata, e.g., all states are final, are applied to this combined model. In the end, the paper presents a comprehensive hierarchy of all related language families.\u0000</p></div>","PeriodicalId":7189,"journal":{"name":"Acta Informatica","volume":"59 5","pages":"557 - 584"},"PeriodicalIF":0.6,"publicationDate":"2022-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"50045696","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
Hierarchical heuristics for Boolean-reasoning-based binary bicluster induction 基于布尔推理的二元双聚类归纳的层次启发式方法
IF 0.6 4区 计算机科学
Acta Informatica Pub Date : 2022-01-21 DOI: 10.1007/s00236-021-00415-9
Marcin Michalak
{"title":"Hierarchical heuristics for Boolean-reasoning-based binary bicluster induction","authors":"Marcin Michalak","doi":"10.1007/s00236-021-00415-9","DOIUrl":"10.1007/s00236-021-00415-9","url":null,"abstract":"<div><p>Biclustering is a two-dimensional data analysis technique that, applied to a matrix, searches for a subset of rows and columns that intersect to produce a submatrix with given, expected features. Such an approach requires different methods to those of typical classification or regression tasks. In recent years it has become possible to express biclustering goals in the form of Boolean reasoning. This paper presents a new, heuristic approach to bicluster induction in binary data.</p></div>","PeriodicalId":7189,"journal":{"name":"Acta Informatica","volume":"59 6","pages":"673 - 685"},"PeriodicalIF":0.6,"publicationDate":"2022-01-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s00236-021-00415-9.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44249506","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}
引用次数: 2
Improved complement for two-way alternating automata 双向交替自动机的改进补码
IF 0.6 4区 计算机科学
Acta Informatica Pub Date : 2022-01-21 DOI: 10.1007/s00236-021-00414-w
Viliam Geffert, Christos A. Kapoutsis, Mohammad Zakzok
{"title":"Improved complement for two-way alternating automata","authors":"Viliam Geffert,&nbsp;Christos A. Kapoutsis,&nbsp;Mohammad Zakzok","doi":"10.1007/s00236-021-00414-w","DOIUrl":"10.1007/s00236-021-00414-w","url":null,"abstract":"<div><p>For each <i>two-way alternating finite automaton</i> (<span>a</span> <span>fa</span>) <i>A</i> with <i>s</i> states, we directly build a <span>a</span> <span>fa</span> <span>(A^c )</span> with <span>(O(s^6))</span> states which accepts exactly those inputs that are not accepted by <i>A</i>. This improves upon the previously best-known construction, which was both more expensive and more complicated, as it required <span>(O(s^7))</span> states and involved building and simulating an intermediate linear-bounded automaton.</p></div>","PeriodicalId":7189,"journal":{"name":"Acta Informatica","volume":"59 5","pages":"619 - 669"},"PeriodicalIF":0.6,"publicationDate":"2022-01-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s00236-021-00414-w.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46498404","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
Index appearance record with preorders 带预订的索引外观记录
IF 0.6 4区 计算机科学
Acta Informatica Pub Date : 2021-12-30 DOI: 10.1007/s00236-021-00412-y
Jan Křetínský, Tobias Meggendorfer, Clara Waldmann, Maximilian Weininger
{"title":"Index appearance record with preorders","authors":"Jan Křetínský,&nbsp;Tobias Meggendorfer,&nbsp;Clara Waldmann,&nbsp;Maximilian Weininger","doi":"10.1007/s00236-021-00412-y","DOIUrl":"10.1007/s00236-021-00412-y","url":null,"abstract":"<div><p>Transforming <span>(omega )</span>-automata into parity automata is traditionally done using appearance records. We present an efficient variant of this idea, tailored to Rabin automata, and several optimizations applicable to all appearance records. We compare the methods experimentally and show that our method produces significantly smaller automata than previous approaches.</p></div>","PeriodicalId":7189,"journal":{"name":"Acta Informatica","volume":"59 5","pages":"585 - 618"},"PeriodicalIF":0.6,"publicationDate":"2021-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s00236-021-00412-y.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49413553","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
Correction to: Reactive synthesis without regret 更正为：反应合成无遗憾
IF 0.6 4区 计算机科学
Acta Informatica Pub Date : 2021-10-20 DOI: 10.1007/s00236-021-00410-0
Paul Hunter, Guillermo A. Pérez, Jean-François Raskin
{"title":"Correction to: Reactive synthesis without regret","authors":"Paul Hunter,&nbsp;Guillermo A. Pérez,&nbsp;Jean-François Raskin","doi":"10.1007/s00236-021-00410-0","DOIUrl":"10.1007/s00236-021-00410-0","url":null,"abstract":"","PeriodicalId":7189,"journal":{"name":"Acta Informatica","volume":"59 5","pages":"671 - 671"},"PeriodicalIF":0.6,"publicationDate":"2021-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48681144","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
Correction to: Sound reasoning in tock-CSP 修正:合理的推理在股票- csp
IF 0.6 4区 计算机科学
Acta Informatica Pub Date : 2021-10-15 DOI: 10.1007/s00236-021-00409-7
James Baxter, Pedro Ribeiro, Ana Cavalcanti
{"title":"Correction to: Sound reasoning in tock-CSP","authors":"James Baxter,&nbsp;Pedro Ribeiro,&nbsp;Ana Cavalcanti","doi":"10.1007/s00236-021-00409-7","DOIUrl":"10.1007/s00236-021-00409-7","url":null,"abstract":"","PeriodicalId":7189,"journal":{"name":"Acta Informatica","volume":"59 2-3","pages":"283 - 283"},"PeriodicalIF":0.6,"publicationDate":"2021-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"50030418","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
Interface Automata for Shared Memory 共享内存的接口自动机
IF 0.6 4区 计算机科学
Acta Informatica Pub Date : 2021-08-30 DOI: 10.1007/s00236-021-00408-8
Ayleen Schinko, Walter Vogler, Johannes Gareis, N. Tri Nguyen, Gerald Lüttgen
{"title":"Interface Automata for Shared Memory","authors":"Ayleen Schinko,&nbsp;Walter Vogler,&nbsp;Johannes Gareis,&nbsp;N. Tri Nguyen,&nbsp;Gerald Lüttgen","doi":"10.1007/s00236-021-00408-8","DOIUrl":"10.1007/s00236-021-00408-8","url":null,"abstract":"<div><p>Interface theories based on <i>Interface Automata</i> (IA) are formalisms for the component-based specification of concurrent systems. Extensions of their basic synchronization mechanism permit the modelling of data, but are studied in more complex settings involving modal transition systems or do not abstract from internal computation. In this article, we show how de Alfaro and Henzinger’s original IA theory can be conservatively extended by shared memory data, without sacrificing simplicity or imposing restrictions. Our extension <i>IA for shared Memory</i> (IAM) decorates transitions with pre- and post-conditions over algebraic expressions on shared variables, which are taken into account by IA’s notion of component compatibility. Simplicity is preserved as IAM can be embedded into IA and, thus, accurately lifts IA’s compatibility concept to shared memory. We also provide a ground semantics for IAM that demonstrates that our abstract handling of data within IA’s open systems view is faithful to the standard treatment of data in closed systems.</p></div>","PeriodicalId":7189,"journal":{"name":"Acta Informatica","volume":"59 5","pages":"521 - 556"},"PeriodicalIF":0.6,"publicationDate":"2021-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s00236-021-00408-8.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43163802","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}
引用次数: 2
Regular numeral systems for data structures 数据结构的正则数字系统
IF 0.6 4区 计算机科学
Acta Informatica Pub Date : 2021-07-25 DOI: 10.1007/s00236-021-00407-9
Amr Elmasry, Jyrki Katajainen
{"title":"Regular numeral systems for data structures","authors":"Amr Elmasry,&nbsp;Jyrki Katajainen","doi":"10.1007/s00236-021-00407-9","DOIUrl":"10.1007/s00236-021-00407-9","url":null,"abstract":"<div><p>We formalize several regular numeral systems, state their properties and supported operations, clarify the correctness, and tabulate the proofs. Our goal is to use as few symbols in the presentation of digits and make as few digit changes as possible in every operation. Most importantly, we introduce two new systems: (1) the buffered regular system is simple and allows the increment and decrement of the least-significant digit in constant time, and (2) the strictly regular system allows the increment and decrement of a digit at arbitrary position with a constant number of digit changes while using three symbols only (instead of four symbols required by the extended regular system). To demonstrate the usefulness of the regular systems, we survey how they have been used in the design of data structures.</p></div>","PeriodicalId":7189,"journal":{"name":"Acta Informatica","volume":"59 2-3","pages":"245 - 281"},"PeriodicalIF":0.6,"publicationDate":"2021-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s00236-021-00407-9","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"50102643","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
A faster algorithm for the Birthday Song Singers Synchronization Problem (FSSP) in one-dimensional CA with multiple speeds 一维多速度CA中生日歌曲同步问题(FSSP)的快速算法
IF 0.6 4区 计算机科学
Acta Informatica Pub Date : 2021-07-19 DOI: 10.1007/s00236-020-00383-6
Thomas Worsch
{"title":"A faster algorithm for the Birthday Song Singers Synchronization Problem (FSSP) in one-dimensional CA with multiple speeds","authors":"Thomas Worsch","doi":"10.1007/s00236-020-00383-6","DOIUrl":"10.1007/s00236-020-00383-6","url":null,"abstract":"<div><p>In cellular automata with multiple speeds for each cell <i>i</i> there is a positive integer <span>(p_i)</span> such that this cell updates its state still periodically but only at times which are a multiple of <span>(p_i)</span>. Additionally there is a finite upper bound on all <span>(p_i)</span>. Manzoni and Umeo have described an algorithm for these (one-dimensional) cellular automata which solves the Firing Squad Synchronization Problem. This algorithm needs linear time (in the number of cells to be synchronized) but for many problem instances it is slower than the optimum time by some positive constant factor. In the present paper we derive lower bounds on possible synchronization times and describe an algorithm which is never slower and in some cases faster than the one by Manzoni and Umeo and which is close to a lower bound (up to a constant summand) in more cases.</p></div>","PeriodicalId":7189,"journal":{"name":"Acta Informatica","volume":"58 4","pages":"451 - 462"},"PeriodicalIF":0.6,"publicationDate":"2021-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s00236-020-00383-6","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42826962","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
An instruction set for reversible Turing machines 可逆图灵机的指令集
IF 0.6 4区 计算机科学
Acta Informatica Pub Date : 2021-07-19 DOI: 10.1007/s00236-020-00388-1
Kenichi Morita
{"title":"An instruction set for reversible Turing machines","authors":"Kenichi Morita","doi":"10.1007/s00236-020-00388-1","DOIUrl":"10.1007/s00236-020-00388-1","url":null,"abstract":"<div><p>A reversible Turing machine (RTM) is a standard model of reversible computing that reflects physical reversibility. So far, to describe an RTM the quadruple formulation and the quintuple formulation have been used. In this paper, we propose the program form as a new formulation for RTMs. There, an RTM is described by a sequence of only five kinds of instructions. It is shown that any RTM in the quintuple form is converted to an RTM in the program form, and <i>vice versa</i>. We also show each instruction is implemented by a particular reversible logic element with memory called a rotary element (RE) very simply. Hence, a circuit that simulates a given RTM is easily and systematically constructed out of REs.</p></div>","PeriodicalId":7189,"journal":{"name":"Acta Informatica","volume":"58 4","pages":"377 - 396"},"PeriodicalIF":0.6,"publicationDate":"2021-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s00236-020-00388-1","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"50037720","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
首页 上一页 下一页 尾页
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学术文献互助群
群 号：604180095
Book学术官方微信