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

Rairo-Theoretical Informatics and Applications最新文献

筛选
英文 中文
ON THE SCIENTIFIC PARADIGM OF INFORMATICS: DATA, INFORMATION, AND KNOWLEDGE 论信息学的科学范式:数据、信息和知识
IF 0.6 4区 计算机科学
Rairo-Theoretical Informatics and Applications Pub Date : 2023-04-10 DOI: 10.14357/19922264230115
{"title":"ON THE SCIENTIFIC PARADIGM OF INFORMATICS: DATA, INFORMATION, AND KNOWLEDGE","authors":"","doi":"10.14357/19922264230115","DOIUrl":"https://doi.org/10.14357/19922264230115","url":null,"abstract":"","PeriodicalId":54510,"journal":{"name":"Rairo-Theoretical Informatics and Applications","volume":"78 1","pages":""},"PeriodicalIF":0.6,"publicationDate":"2023-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88355233","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
TESTS FOR NORMALITY OF THE PROBABILISTIC DISTRIBUTION WHEN DATA ARE ROUNDED 当数据四舍五入时，检验概率分布的正态性
IF 0.6 4区 计算机科学
Rairo-Theoretical Informatics and Applications Pub Date : 2023-04-10 DOI: 10.14357/19922264230103
{"title":"TESTS FOR NORMALITY OF THE PROBABILISTIC DISTRIBUTION WHEN DATA ARE ROUNDED","authors":"","doi":"10.14357/19922264230103","DOIUrl":"https://doi.org/10.14357/19922264230103","url":null,"abstract":"","PeriodicalId":54510,"journal":{"name":"Rairo-Theoretical Informatics and Applications","volume":"3 1","pages":""},"PeriodicalIF":0.6,"publicationDate":"2023-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89292176","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
ESTIMATES OF THE RESOURCE DISTRIBUTION IN THE MULTIUSER NETWORK WITH EQUAL INTERNODAL LOADS 具有相等节点间负载的多用户网络中资源分配的估计
IF 0.6 4区 计算机科学
Rairo-Theoretical Informatics and Applications Pub Date : 2023-04-10 DOI: 10.14357/19922264230111
{"title":"ESTIMATES OF THE RESOURCE DISTRIBUTION IN THE MULTIUSER NETWORK WITH EQUAL INTERNODAL LOADS","authors":"","doi":"10.14357/19922264230111","DOIUrl":"https://doi.org/10.14357/19922264230111","url":null,"abstract":"","PeriodicalId":54510,"journal":{"name":"Rairo-Theoretical Informatics and Applications","volume":"92 1","pages":""},"PeriodicalIF":0.6,"publicationDate":"2023-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83749416","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 PROBLEM OF ASSESSING AND ANALYZING TRAFFIC ACCIDENTS RISK ON THE RAIL TRANSPORT 铁路运输交通事故风险评估与分析问题研究
IF 0.6 4区 计算机科学
Rairo-Theoretical Informatics and Applications Pub Date : 2023-04-10 DOI: 10.14357/19922264230110
{"title":"ON THE PROBLEM OF ASSESSING AND ANALYZING TRAFFIC ACCIDENTS RISK ON THE RAIL TRANSPORT","authors":"","doi":"10.14357/19922264230110","DOIUrl":"https://doi.org/10.14357/19922264230110","url":null,"abstract":"","PeriodicalId":54510,"journal":{"name":"Rairo-Theoretical Informatics and Applications","volume":"16 1","pages":""},"PeriodicalIF":0.6,"publicationDate":"2023-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77157462","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
CAUSAL RELATIONSHIPS IN CLASSIFICATION PROBLEMS 分类问题中的因果关系
IF 0.6 4区 计算机科学
Rairo-Theoretical Informatics and Applications Pub Date : 2023-04-10 DOI: 10.14357/19922264230106
{"title":"CAUSAL RELATIONSHIPS IN CLASSIFICATION PROBLEMS","authors":"","doi":"10.14357/19922264230106","DOIUrl":"https://doi.org/10.14357/19922264230106","url":null,"abstract":"","PeriodicalId":54510,"journal":{"name":"Rairo-Theoretical Informatics and Applications","volume":"82 1 1","pages":""},"PeriodicalIF":0.6,"publicationDate":"2023-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80065667","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
ANALYTICAL MODELING OF DISTRIBUTIONS WITH INVARIANT MEASURE IN STOCHASTIC SYSTEMS WITH UNSOLVED DERIVATIVES 微分未解随机系统中不变测度分布的解析建模
IF 0.6 4区 计算机科学
Rairo-Theoretical Informatics and Applications Pub Date : 2023-04-10 DOI: 10.14357/19922264230101
{"title":"ANALYTICAL MODELING OF DISTRIBUTIONS WITH INVARIANT MEASURE IN STOCHASTIC SYSTEMS WITH UNSOLVED DERIVATIVES","authors":"","doi":"10.14357/19922264230101","DOIUrl":"https://doi.org/10.14357/19922264230101","url":null,"abstract":"","PeriodicalId":54510,"journal":{"name":"Rairo-Theoretical Informatics and Applications","volume":"22 1","pages":""},"PeriodicalIF":0.6,"publicationDate":"2023-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90319110","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
OPTIMAL SPANNING TREE RECONSTRUCTION IN SYMBOLIC REGRESSION 符号回归中的最优生成树重构
IF 0.6 4区 计算机科学
Rairo-Theoretical Informatics and Applications Pub Date : 2023-04-10 DOI: 10.14357/19922264230105
{"title":"OPTIMAL SPANNING TREE RECONSTRUCTION IN SYMBOLIC REGRESSION","authors":"","doi":"10.14357/19922264230105","DOIUrl":"https://doi.org/10.14357/19922264230105","url":null,"abstract":"","PeriodicalId":54510,"journal":{"name":"Rairo-Theoretical Informatics and Applications","volume":"1 1","pages":""},"PeriodicalIF":0.6,"publicationDate":"2023-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85066666","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
Relations of contextual grammars with strictly locally testable selection languages 上下文语法与严格局部可测试选择语言的关系
4区 计算机科学
Rairo-Theoretical Informatics and Applications Pub Date : 2023-01-01 DOI: 10.1051/ita/2023012
Jürgen Dassow, Bianca Truthe
{"title":"Relations of contextual grammars with strictly locally testable selection languages","authors":"Jürgen Dassow, Bianca Truthe","doi":"10.1051/ita/2023012","DOIUrl":"https://doi.org/10.1051/ita/2023012","url":null,"abstract":"We continue the research on the generative capacity of contextual grammars where contexts are adjoined around whole words (externally) or around subwords (internally) which belong to special regular selection languages. All languages generated by contextual grammars where all selection languages are elements of a certain subregular language family form again a language family. We investigate the computational capacity of contextual grammars with strictly locally testable selection languages and compare those families to families which are based on finite, monoidal, nilpotent, combinational, definite, suffix-closed, ordered, commutative, circular, non-counting, power-separating, or union-free languages. With these results, also an open problem regarding ordered and non-counting selection languages is solved.","PeriodicalId":54510,"journal":{"name":"Rairo-Theoretical Informatics and Applications","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135660089","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
Non-returning deterministic and nondeterministic finite automata with translucent letters 带有半透明字母的不返回确定性和非确定性有限自动机
4区 计算机科学
Rairo-Theoretical Informatics and Applications Pub Date : 2023-01-01 DOI: 10.1051/ita/2023009
František Mráz, Friedrich Otto
{"title":"Non-returning deterministic and nondeterministic finite automata with translucent letters","authors":"František Mráz, Friedrich Otto","doi":"10.1051/ita/2023009","DOIUrl":"https://doi.org/10.1051/ita/2023009","url":null,"abstract":"Here, we propose a variant of the nondeterministic finite automaton with translucent letters (NFAwtl), which, after reading and deleting a letter, does not return to the left end of its tape, but instead continues from the position of the letter just deleted. When the end-of-tape marker is reached, our automaton can decide whether to accept, reject, or continue, which means that it reads the remaining tape contents again from the beginning. This type of automaton, called a non-returning finite automaton with translucent letters or an nrNFAwtl , is strictly more expressive than the NFAwtl. We study the expressive capacity of this type of automaton and that of its deterministic variant, comparing them to various other types of finite automata that do not simply read their input from left to right. Also, we are interested in the closure properties of the resulting classes of languages and in the complexity of the fixed membership problem.","PeriodicalId":54510,"journal":{"name":"Rairo-Theoretical Informatics and Applications","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135007991","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 accepting state complexity of operations on permutation automata 论置换自动机运算的接受状态复杂度
4区 计算机科学
Rairo-Theoretical Informatics and Applications Pub Date : 2023-01-01 DOI: 10.1051/ita/2023010
Christian Rauch, Markus Holzer
{"title":"On the accepting state complexity of operations on permutation automata","authors":"Christian Rauch, Markus Holzer","doi":"10.1051/ita/2023010","DOIUrl":"https://doi.org/10.1051/ita/2023010","url":null,"abstract":"We investigate the accepting state complexity of deterministic finite automata for regular languages obtained by applying one of the following operations on languages accepted by permutation automata: union, quotient, complement, difference, intersection, Kleene star, Kleene plus, and reversal. The paper thus joins the study of the accepting state complexity of regularity preserving language operations which was initiated in [J. Dassow, J. Autom., Lang. Comb. 21 (2016) 55–67]. We show that for almost all of the above-mentioned operations, except for reversal and quotient, there is no difference in the accepting state complexity for permutation automata compared to deterministic finite automata in general. For both reversal and quotient we prove that certain accepting state complexities cannot be obtained; these numbers are called “magic” in the literature. Moreover, we solve the left open accepting state complexity problem for the intersection of unary languages accepted by permutation automata and deterministic finite automata in general.","PeriodicalId":54510,"journal":{"name":"Rairo-Theoretical Informatics and Applications","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135506587","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学术文献互助群
群 号：481959085
Book学术官方微信