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

Acta Informatica最新文献

筛选
英文 中文
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
On the size of partial derivatives and the word membership problem 关于偏导数的大小和词的隶属度问题
IF 0.6 4区 计算机科学
Acta Informatica Pub Date : 2021-07-19 DOI: 10.1007/s00236-021-00399-6
Stavros Konstantinidis, António Machiavelo, Nelma Moreira, Rogério Reis
{"title":"On the size of partial derivatives and the word membership problem","authors":"Stavros Konstantinidis,&nbsp;António Machiavelo,&nbsp;Nelma Moreira,&nbsp;Rogério Reis","doi":"10.1007/s00236-021-00399-6","DOIUrl":"10.1007/s00236-021-00399-6","url":null,"abstract":"<div><p>Partial derivatives are widely used to convert regular expressions to nondeterministic automata. For the word membership problem, it is not strictly necessary to build an automaton. In this paper, we study the size of partial derivatives on the average case. For expressions in strong star normal form, we show that on average and asymptotically the largest partial derivative is at most half the size of the expression. The results are obtained in the framework of analytic combinatorics considering generating functions of parametrised combinatorial classes defined implicitly by algebraic curves. Our average case estimates suggest that a detailed word membership algorithm based directly on partial derivatives should be analysed both theoretically and experimentally.</p></div>","PeriodicalId":7189,"journal":{"name":"Acta Informatica","volume":"58 4","pages":"357 - 375"},"PeriodicalIF":0.6,"publicationDate":"2021-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s00236-021-00399-6","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"50037379","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
Reversible parallel communicating finite automata systems 可逆并行通信有限自动机系统
IF 0.6 4区 计算机科学
Acta Informatica Pub Date : 2021-07-19 DOI: 10.1007/s00236-021-00396-9
Henning Bordihn, György Vaszil
{"title":"Reversible parallel communicating finite automata systems","authors":"Henning Bordihn,&nbsp;György Vaszil","doi":"10.1007/s00236-021-00396-9","DOIUrl":"10.1007/s00236-021-00396-9","url":null,"abstract":"<div><p>We study the concept of reversibility in connection with parallel communicating systems of finite automata (PCFA in short). We define the notion of reversibility in the case of PCFA (also covering the non-deterministic case) and discuss the relationship of the reversibility of the systems and the reversibility of its components. We show that a system can be reversible with non-reversible components, and the other way around, the reversibility of the components does not necessarily imply the reversibility of the system as a whole. We also investigate the computational power of deterministic centralized reversible PCFA. We show that these very simple types of PCFA (returning or non-returning) can recognize regular languages which cannot be accepted by reversible (deterministic) finite automata, and that they can even accept languages that are not context-free. We also separate the deterministic and non-deterministic variants in the case of systems with non-returning communication. We show that there are languages accepted by non-deterministic centralized PCFA, which cannot be recognized by any deterministic variant of the same type.</p></div>","PeriodicalId":7189,"journal":{"name":"Acta Informatica","volume":"58 4","pages":"263 - 279"},"PeriodicalIF":0.6,"publicationDate":"2021-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s00236-021-00396-9","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46009101","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 right linear grammars 操作复杂性和正确的线性语法
IF 0.6 4区 计算机科学
Acta Informatica Pub Date : 2021-07-19 DOI: 10.1007/s00236-020-00386-3
Jürgen Dassow
{"title":"Operational complexity and right linear grammars","authors":"Jürgen Dassow","doi":"10.1007/s00236-020-00386-3","DOIUrl":"10.1007/s00236-020-00386-3","url":null,"abstract":"<div><p>For a regular language <i>L</i>, let <span>({{,mathrm{Var},}}(L))</span> be the minimal number of nonterminals necessary to generate <i>L</i> by right linear grammars. Moreover, for natural numbers <span>(k_1,k_2,ldots ,k_n)</span> and an <i>n</i>-ary regularity preserving operation <i>f</i>, let <span>(g_f^{{{,mathrm{Var},}}}(k_1,k_2,ldots ,k_n))</span> be the set of all numbers <i>k</i> such that there are regular languages <span>(L_1,L_2,ldots , L_n)</span> such that <span>({{,mathrm{Var},}}(L_i)=k_i)</span> for <span>(1le ile n)</span> and <span>({{,mathrm{Var},}}(f(L_1,L_2,ldots , L_n))=k)</span>. We completely determine the sets <span>(g_f^{{{,mathrm{Var},}}})</span> for the operations reversal, Kleene-closures <span>(+)</span> and <span>(*)</span>, and union; and we give partial results for product and intersection.</p></div>","PeriodicalId":7189,"journal":{"name":"Acta Informatica","volume":"58 4","pages":"281 - 299"},"PeriodicalIF":0.6,"publicationDate":"2021-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s00236-020-00386-3","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"50037375","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
Reversibility for stateless ordered RRWW-automata 无状态有序rrww自动机的可逆性
IF 0.6 4区 计算机科学
Acta Informatica Pub Date : 2021-07-19 DOI: 10.1007/s00236-020-00389-0
Friedrich Otto, Matthias Wendlandt
{"title":"Reversibility for stateless ordered RRWW-automata","authors":"Friedrich Otto,&nbsp;Matthias Wendlandt","doi":"10.1007/s00236-020-00389-0","DOIUrl":"10.1007/s00236-020-00389-0","url":null,"abstract":"<div><p>There are two types of stateless deterministic ordered restarting automata that both characterize the class of regular languages: the stl-det-ORWW-automaton and the stl-det-ORRWW-automaton. For the former a notion of <i>reversibility</i> has been introduced and studied that is very much tuned to the way in which restarting automata work. Here we suggest another, more classical, notion of reversibility for stl-det-ORRWW-automata, and we show that each regular language is accepted by such a reversible stl-det-ORRWW-automaton. We study the descriptional complexity of these automata, showing that they are exponentially more succinct than nondeterministic finite-state acceptors. We also look at the case of unary input alphabets.</p></div>","PeriodicalId":7189,"journal":{"name":"Acta Informatica","volume":"58 4","pages":"397 - 425"},"PeriodicalIF":0.6,"publicationDate":"2021-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s00236-020-00389-0","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"50037380","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
Preface to Martin Kutrib Festschrift 马丁·库特里布艺术节序言
IF 0.6 4区 计算机科学
Acta Informatica Pub Date : 2021-07-19 DOI: 10.1007/s00236-021-00401-1
Henning Fernau, Andreas Malcher, Giovanni Pighizzini
{"title":"Preface to Martin Kutrib Festschrift","authors":"Henning Fernau,&nbsp;Andreas Malcher,&nbsp;Giovanni Pighizzini","doi":"10.1007/s00236-021-00401-1","DOIUrl":"10.1007/s00236-021-00401-1","url":null,"abstract":"","PeriodicalId":7189,"journal":{"name":"Acta Informatica","volume":"58 4","pages":"241 - 242"},"PeriodicalIF":0.6,"publicationDate":"2021-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s00236-021-00401-1","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42362666","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
Nilpotency and periodic points in non-uniform cellular automata 非均匀元胞自动机的幂零和周期点
IF 0.6 4区 计算机科学
Acta Informatica Pub Date : 2021-07-19 DOI: 10.1007/s00236-020-00390-7
Supreeti Kamilya, Jarkko Kari
{"title":"Nilpotency and periodic points in non-uniform cellular automata","authors":"Supreeti Kamilya,&nbsp;Jarkko Kari","doi":"10.1007/s00236-020-00390-7","DOIUrl":"10.1007/s00236-020-00390-7","url":null,"abstract":"<div><p>Nilpotent cellular automata have the simplest possible dynamics: all initial configurations lead in bounded time into the unique fixed point of the system. We investigate nilpotency in the setup of one-dimensional non-uniform cellular automata (NUCA) where different cells may use different local rules. There are infinitely many cells in NUCA but only a finite number of different local rules. Changing the distribution of the local rules in the system may drastically change the dynamics. We prove that if the available local rules are such that every periodic distribution of the rules leads to nilpotent behavior then so do also all eventually periodic distributions. However, in some cases there may be non-periodic distributions that are not nilpotent even if all periodic distributions are nilpotent. We demonstrate such a possibility using aperiodic Wang tile sets. We also investigate temporally periodic points in NUCA. In contrast to classical uniform cellular automata, there are NUCA—even reversible equicontinuous ones—that do not have any temporally periodic points. We prove the undecidability of this property: there is no algorithm to determine if a NUCA with a given finite distribution of local rules has a periodic point.</p></div>","PeriodicalId":7189,"journal":{"name":"Acta Informatica","volume":"58 4","pages":"319 - 333"},"PeriodicalIF":0.6,"publicationDate":"2021-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s00236-020-00390-7","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"50037377","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
On the number of active states in finite automata 有限自动机中活动状态的数目
IF 0.6 4区 计算机科学
Acta Informatica Pub Date : 2021-07-19 DOI: 10.1007/s00236-021-00397-8
Henning Bordihn, M. Holzer
{"title":"On the number of active states in finite automata","authors":"Henning Bordihn, M. Holzer","doi":"10.1007/s00236-021-00397-8","DOIUrl":"https://doi.org/10.1007/s00236-021-00397-8","url":null,"abstract":"","PeriodicalId":7189,"journal":{"name":"Acta Informatica","volume":"58 1","pages":"301 - 318"},"PeriodicalIF":0.6,"publicationDate":"2021-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s00236-021-00397-8","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"52289281","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
Natural language guided object retrieval in images 自然语言引导下的图像对象检索
IF 0.6 4区 计算机科学
Acta Informatica Pub Date : 2021-07-19 DOI: 10.1007/s00236-021-00400-2
Ahmad Ostovar, Suna Bensch, Thomas Hellström
{"title":"Natural language guided object retrieval in images","authors":"Ahmad Ostovar,&nbsp;Suna Bensch,&nbsp;Thomas Hellström","doi":"10.1007/s00236-021-00400-2","DOIUrl":"10.1007/s00236-021-00400-2","url":null,"abstract":"<div><p>The ability to understand the surrounding environment and being able to communicate with interacting humans are important functionalities for many automated systems where visual input (e.g., images, video) and natural language input (speech or text) have to be related to each other. Possible applications are automatic image caption generation, interactive surveillance systems, or human robot interaction. In this paper, we propose algorithms for automatic responses to natural language queries about an image. Our approach uses a predefined neural net for detection of bounding boxes and objects in images, spatial relations between bounding boxes are modeled with a neural net, the queries are analyzed with a syntactic parser, and algorithms to map natural language to properties in the images are introduced. The algorithms make use of semantic similarity and antonyms. We evaluate the performance of our approach with test users assessing the quality of our system’s generated answers.</p></div>","PeriodicalId":7189,"journal":{"name":"Acta Informatica","volume":"58 4","pages":"243 - 261"},"PeriodicalIF":0.6,"publicationDate":"2021-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s00236-021-00400-2","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45642608","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
首页 上一页 下一页 尾页
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学术官方微信