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

RAIRO Theor. Informatics Appl.最新文献

筛选
英文 中文
The connectivity and nature diagnosability of expanded k-ary n-cubes 扩展k元n立方的连通性和可诊断性
RAIRO Theor. Informatics Appl. Pub Date : 2017-04-01 DOI: 10.1051/ita/2017008
Mujiangshan Wang, Yuqing Lin, Shiying Wang
{"title":"The connectivity and nature diagnosability of expanded k-ary n-cubes","authors":"Mujiangshan Wang, Yuqing Lin, Shiying Wang","doi":"10.1051/ita/2017008","DOIUrl":"https://doi.org/10.1051/ita/2017008","url":null,"abstract":"Connectivity and Diagnosability play an important role in measuring the fault tolerance of interconnection networks. As a topology structure of interconnection networks, the expanded k -ary n -cube X Q k n has many good properties. In this paper, we prove that (1) the connectivity of X Q k n is 4 n ; (2) the nature connectivity of X Q k n is 8 n − 4; (3) the nature diagnosability of X Q k n under the PMC model and MM ∗ model is 8 n − 3 for n ≥ 2.","PeriodicalId":438841,"journal":{"name":"RAIRO Theor. Informatics Appl.","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121896953","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 8
A Better bound of randomized algorithms for the multislope ski-rental problem 多坡滑雪板租赁问题的一种更好的随机化算法界
RAIRO Theor. Informatics Appl. Pub Date : 2017-04-01 DOI: 10.1051/ita/2017009
Maolin Hu, Wei-jun Xu
{"title":"A Better bound of randomized algorithms for the multislope ski-rental problem","authors":"Maolin Hu, Wei-jun Xu","doi":"10.1051/ita/2017009","DOIUrl":"https://doi.org/10.1051/ita/2017009","url":null,"abstract":"The multislope ski-rental problem is an extension of the classical ski-rental problem, where the player has several lease options in addition to the pure rent and buy options. For the additive general model, Lotker, Patt-Shamir and Rawitz [in: SIAM J. Discr. Math. 26 (2012) 718–736] obtained a randomized algorithm with the competitive ratio bounded by . However, obtaining a better bound on the competitive factor as a function of the slopes parameters remains an open problem in their paper. In this paper, we study randomized algorithm for the additive multislope ski rental problem, and extend the competitive ratio bound proposed by Lotker et al. to .","PeriodicalId":438841,"journal":{"name":"RAIRO Theor. Informatics Appl.","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126331981","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 9
Maintenance of a Spanning Tree For Dynamic Graphs by Mobile Agents and Local Computations 基于移动代理和局部计算的动态图生成树维护
RAIRO Theor. Informatics Appl. Pub Date : 2017-04-01 DOI: 10.1051/ita/2017007
Mouna Ktari, M. Haddar, M. Mosbah, A. Kacem
{"title":"Maintenance of a Spanning Tree For Dynamic Graphs by Mobile Agents and Local Computations","authors":"Mouna Ktari, M. Haddar, M. Mosbah, A. Kacem","doi":"10.1051/ita/2017007","DOIUrl":"https://doi.org/10.1051/ita/2017007","url":null,"abstract":"The problem of constructing and maintaining a spanning tree in dynamic networks is important in distributed systems. Trees are essential structures in various communication protocols such as information broadcasting, routing, etc. In a distributed computing environment, the solution of this problem has many practical motivations. To make designing distributed algorithm easier, we model this latter with a local computation model. Based on the mobile agent paradigm, we present in this paper a distributed algorithm that maintain a hierarchical spanning tree in dynamic networks. We study all topological events that may affect the structure of the spanning tree: we address the appearance and the disappearance of places and communication channels.","PeriodicalId":438841,"journal":{"name":"RAIRO Theor. Informatics Appl.","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128643157","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
On avoidability of formulas with reversal 带反转的公式的可避免性
RAIRO Theor. Informatics Appl. Pub Date : 2017-03-30 DOI: 10.1051/ita/2017013
J. Currie, Lucas Mol, N. Rampersad
{"title":"On avoidability of formulas with reversal","authors":"J. Currie, Lucas Mol, N. Rampersad","doi":"10.1051/ita/2017013","DOIUrl":"https://doi.org/10.1051/ita/2017013","url":null,"abstract":"While a characterization of unavoidable formulas (without reversal) is well-known, little is known about the avoidability of formulas with reversal in general. In this article, we characterize the unavoidable formulas with reversal that have at most two one-way variables ($x$ is a one-way variable in formula with reversal $phi$ if exactly one of $x$ and $x^R$ appears in $phi$).","PeriodicalId":438841,"journal":{"name":"RAIRO Theor. Informatics Appl.","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130853844","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Input- or output-unary sweeping transducers are weaker than their 2-way counterparts 输入或输出一元扫描换能器比它们的双向扫描换能器弱
RAIRO Theor. Informatics Appl. Pub Date : 2016-10-01 DOI: 10.1051/ita/2016028
B. Guillon
{"title":"Input- or output-unary sweeping transducers are weaker than their 2-way counterparts","authors":"B. Guillon","doi":"10.1051/ita/2016028","DOIUrl":"https://doi.org/10.1051/ita/2016028","url":null,"abstract":"In a previous paper we showed that two-way (nondeterministic) transducers with unary input and output alphabets have the same recognition power as the sweeping ones. We show that this no longer holds when one of the alphabets has cardinality at least 2.","PeriodicalId":438841,"journal":{"name":"RAIRO Theor. Informatics Appl.","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124092068","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
Preface: Non-Classical Models of Automata and Applications VII 前言:非经典自动机模型及其应用7
RAIRO Theor. Informatics Appl. Pub Date : 2016-10-01 DOI: 10.1051/ita/2017003
M. Holzer, Nelma Moreira, Rogério Reis
{"title":"Preface: Non-Classical Models of Automata and Applications VII","authors":"M. Holzer, Nelma Moreira, Rogério Reis","doi":"10.1051/ita/2017003","DOIUrl":"https://doi.org/10.1051/ita/2017003","url":null,"abstract":"The Seventh Workshop on Non-Classical Models of Automata and Applications (NCMA 2015) was organised to bring together researchers who work on various aspects of non-classical and classical models of automata, providing an excellent opportunity to develop and discuss novel ideas. Numerous models of automata, both classical and non-classical, are natural objects of theoretical computer science. They are studied from different perspectives in various areas, both as theoretical concepts and as formal models for applications. The purpose of the NCMA workshop series is to promote a deeper and interdisciplinary coverage of this particular area and in this way foster new insights and substantial progress in computer science as a whole. Previous NCMA workshops were held in Wroc(cid:3)law (2009), Jena (2010), Milano (2011), Fribourg (2012), Ume˚a (2013) and Kassel (2014). The Seventh Workshop on Non-Classical Models of Automata and Applications (NCMA 2015) took place in Porto, Portugal, on August 31st and September 1st, 2015. It was partially supported by the University of Porto and the Funda¸c˜ao para a Ciˆencia e Tecnologia (FCT). We warmly thank the invited speakers Patricia Boyer-Decitre (LSV, CNRS and ENS de Cachan, France), Sylvain Lombardy (LaBRI, Bordeaux, France) and Emanuele Rodaro (CMUP, University of Porto, Portugal). For NCMA 2015, we received submissions by a total of 22 authors from 8 different countries. From these submissions, on the basis of three referees’ reports each, the Program Committee selected 9 contributions for presentation at NCMA. Also 4 short contributions were presented at the workshop. We thank the members of the Program Committee for their excellent work in making this selection: Maria Paola Bianchi (ETH Z¨urich, Switzerland), Henning Bordihn (Universit¨at Potsdam, Germany), Cezar Cˆampeanu (University of Prince Ed-ward Island, PEI, Canada), Dominik D. Freydenberger (Universit¨at","PeriodicalId":438841,"journal":{"name":"RAIRO Theor. Informatics Appl.","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125652224","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Two-way representations and weighted automata 双向表示和加权自动机
RAIRO Theor. Informatics Appl. Pub Date : 2016-10-01 DOI: 10.1051/ita/2016026
S. Lombardy
{"title":"Two-way representations and weighted automata","authors":"S. Lombardy","doi":"10.1051/ita/2016026","DOIUrl":"https://doi.org/10.1051/ita/2016026","url":null,"abstract":"We study the series realized by weighted two-way automata, that are strictly more powerful than weighted one-way automata. To this end, we consider the Hadamard product and the Hadamard iteration of formal power series. We introduce two-way representations and show that the series they realize are the solutions of fixed-point equations. In rationally additive semirings, we prove that two-way automata are equivalent to two-way representations, and, for some specific classes of two-way automata, rotating and sweeping automata, we give a characterization of the series that can be realized.","PeriodicalId":438841,"journal":{"name":"RAIRO Theor. Informatics Appl.","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115394930","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
When input-driven pushdown automata meet reversiblity 当输入驱动下推自动机满足可逆性时
RAIRO Theor. Informatics Appl. Pub Date : 2016-10-01 DOI: 10.1051/ita/2016016
Martin Kutrib, Andreas Malcher, Matthias Wendlandt
{"title":"When input-driven pushdown automata meet reversiblity","authors":"Martin Kutrib, Andreas Malcher, Matthias Wendlandt","doi":"10.1051/ita/2016016","DOIUrl":"https://doi.org/10.1051/ita/2016016","url":null,"abstract":"We investigate subfamilies of context-free languages that share two important properties. The languages are accepted by input-driven pushdown automata as well as by a reversible pushdown automata. So, the languages are input driven and reversible at the same time. This intersection can be defined on the underlying language families or on the underlying machine classes. It turns out that the latter class is properly included in the former. The relationships between the language families obtained in this way and to reversible context-free languages as well as to input-driven languages are studied. In general, a hierarchical inclusion structure within the real-time deterministic context-free languages is obtained. Finally, the closure properties of these families under the standard operations are investigated and it turns out that all language families introduced are anti-AFLs.","PeriodicalId":438841,"journal":{"name":"RAIRO Theor. Informatics Appl.","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126601704","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
Some classes of rational functions for pictures 若干类图像的有理函数
RAIRO Theor. Informatics Appl. Pub Date : 2016-10-01 DOI: 10.1051/ita/2016025
F. Mráz, F. Otto, D. Prusa
{"title":"Some classes of rational functions for pictures","authors":"F. Mráz, F. Otto, D. Prusa","doi":"10.1051/ita/2016025","DOIUrl":"https://doi.org/10.1051/ita/2016025","url":null,"abstract":"With the aid of homogeneous morphisms, we turn the deterministic two-dimensional two-way ordered restarting automaton and its extended variant into devices that compute transductions of pictures, and we study the resulting classes of transductions in detail.","PeriodicalId":438841,"journal":{"name":"RAIRO Theor. Informatics Appl.","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130825740","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Uncountable classical and quantum complexity classes 不可数的经典和量子复杂性类
RAIRO Theor. Informatics Appl. Pub Date : 2016-08-01 DOI: 10.1051/ita/2018012
M. Dimitrijevs, A. Yakaryılmaz
{"title":"Uncountable classical and quantum complexity classes","authors":"M. Dimitrijevs, A. Yakaryılmaz","doi":"10.1051/ita/2018012","DOIUrl":"https://doi.org/10.1051/ita/2018012","url":null,"abstract":"Polynomial--time constant--space quantum Turing machines (QTMs) and logarithmic--space probabilistic Turing machines (PTMs) recognize uncountably many languages with bounded error (Say and Yakaryilmaz 2014, arXiv:1411.7647). In this paper, we investigate more restricted cases for both models to recognize uncountably many languages with bounded error. We show that double logarithmic space is enough for PTMs on unary languages in sweeping reading mode or logarithmic space for one-way head. On unary languages, for quantum models, we obtain middle logarithmic space for counter machines. For binary languages, arbitrary small non-constant space is enough for PTMs even using only counter as memory. For counter machines, when restricted to polynomial time, we can obtain the same result for linear space. For constant--space QTMs, we follow the result for a restricted sweeping head, known as restarting realtime.","PeriodicalId":438841,"journal":{"name":"RAIRO Theor. Informatics Appl.","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132695603","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
首页 上一页 下一页 尾页
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学术官方微信