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

Acta Informatica最新文献

筛选
英文 中文
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区 计算机科学
Acta Informatica 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
Minimum status of trees with a given degree sequence 具有给定度序列的树的最小状态
IF 0.6 4区 计算机科学
Acta Informatica Pub Date : 2022-02-17 DOI: 10.1007/s00236-022-00416-2
Haiyan Guo, Bo Zhou
{"title":"Minimum status of trees with a given degree sequence","authors":"Haiyan Guo,&nbsp;Bo Zhou","doi":"10.1007/s00236-022-00416-2","DOIUrl":"10.1007/s00236-022-00416-2","url":null,"abstract":"<div><p>The minimum status (or its normalized version called proximity) is a well-known concept in communication network theory. We determine the trees minimizing the minimum status among trees with a given degree sequence, and we show that the trees maximizing the minimum status among trees with a given degree sequence must be caterpillars with specific properties.</p></div>","PeriodicalId":7189,"journal":{"name":"Acta Informatica","volume":"60 1","pages":"1 - 10"},"PeriodicalIF":0.6,"publicationDate":"2022-02-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45578220","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
On Huang and Wong’s algorithm for generalized binary split trees 广义二叉树的Huang和Wong算法
IF 0.6 4区 计算机科学
Acta Informatica Pub Date : 2022-02-14 DOI: 10.1007/s00236-021-00411-z
Marek Chrobak, Mordecai Golin, J. Ian Munro, Neal E. Young
{"title":"On Huang and Wong’s algorithm for generalized binary split trees","authors":"Marek Chrobak,&nbsp;Mordecai Golin,&nbsp;J. Ian Munro,&nbsp;Neal E. Young","doi":"10.1007/s00236-021-00411-z","DOIUrl":"10.1007/s00236-021-00411-z","url":null,"abstract":"<div><p>Huang and Wong (Acta Inform 21(1):113–123, 1984) proposed a polynomial-time dynamic-programming algorithm for computing optimal generalized binary split trees. We show that their algorithm is incorrect. Thus, it remains open whether such trees can be computed in polynomial time. Spuler (Optimal search trees using two-way key comparisons, PhD thesis, 1994) proposed modifying Huang and Wong’s algorithm to obtain an algorithm for a different problem: computing optimal two-way comparison search trees. We show that the dynamic program underlying Spuler’s algorithm is not valid, in that it does not satisfy the necessary optimal-substructure property and its proposed recurrence relation is incorrect. It remains unknown whether the algorithm is guaranteed to compute a correct overall solution.\u0000</p></div>","PeriodicalId":7189,"journal":{"name":"Acta Informatica","volume":"59 6","pages":"687 - 708"},"PeriodicalIF":0.6,"publicationDate":"2022-02-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s00236-021-00411-z.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43409449","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}
引用次数: 5
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
首页 上一页
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学术官方微信