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

Fundamenta Informaticae最新文献

筛选
英文 中文
On the Complexity of L-reachability 论l -可达性的复杂性
IF 0.8 4区 计算机科学
Fundamenta Informaticae Pub Date : 2014-08-05 DOI: 10.3233/FI-2016-1371
Balagopal Komarath, Jayalal Sarma, K. S. Sunil
{"title":"On the Complexity of L-reachability","authors":"Balagopal Komarath, Jayalal Sarma, K. S. Sunil","doi":"10.3233/FI-2016-1371","DOIUrl":"https://doi.org/10.3233/FI-2016-1371","url":null,"abstract":"We initiate a complexity theoretic study of the language based reachability problem (L-reach) : Fix a language L. Given a graph whose edges are labelled with alphabet symbols and two special vertices s and t, test if there is path P from s to t in the graph such that the concatenation of the symbols seen from s to t in the path P forms a string in the language L. We study variants of this problem with different graph classes and different language classes and obtain complexity theoretic characterisations for all of them. Our main results are the following:","PeriodicalId":56310,"journal":{"name":"Fundamenta Informaticae","volume":"61 1","pages":"258-269"},"PeriodicalIF":0.8,"publicationDate":"2014-08-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78321650","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
Epichristoffel Words and Minimization of Moore Automata 摩尔自动机的Epichristoffel词与最小化
IF 0.8 4区 计算机科学
Fundamenta Informaticae Pub Date : 2014-07-01 DOI: 10.5555/2692010.2692015
CastiglioneGiusi, SciortinoMarinella
{"title":"Epichristoffel Words and Minimization of Moore Automata","authors":"CastiglioneGiusi, SciortinoMarinella","doi":"10.5555/2692010.2692015","DOIUrl":"https://doi.org/10.5555/2692010.2692015","url":null,"abstract":"This paper is focused on the connection between the combinatorics of words and minimization of automata. The three main ingredients are the epichristoffel words, Moore automata and a variant of Hop...","PeriodicalId":56310,"journal":{"name":"Fundamenta Informaticae","volume":"120 1","pages":""},"PeriodicalIF":0.8,"publicationDate":"2014-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"71131582","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 Understanding and Prediction 自然语言理解与预测
IF 0.8 4区 计算机科学
Fundamenta Informaticae Pub Date : 2014-07-01 DOI: 10.5555/2608491.2608501
DutaNicolae
{"title":"Natural Language Understanding and Prediction","authors":"DutaNicolae","doi":"10.5555/2608491.2608501","DOIUrl":"https://doi.org/10.5555/2608491.2608501","url":null,"abstract":"Scientists have long dreamed of creating machines humans could interact with by voice. Although one no longer believes Turing's prophecy that machines will be able to converse like humans in the ne...","PeriodicalId":56310,"journal":{"name":"Fundamenta Informaticae","volume":"1 1","pages":""},"PeriodicalIF":0.8,"publicationDate":"2014-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"71130182","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 Canonical Semi-Deterministic Transducer 典型半确定性传感器
IF 0.8 4区 计算机科学
Fundamenta Informaticae Pub Date : 2014-05-10 DOI: 10.3233/FI-2016-1394
Achilles A. Beros, C. D. L. Higuera
{"title":"A Canonical Semi-Deterministic Transducer","authors":"Achilles A. Beros, C. D. L. Higuera","doi":"10.3233/FI-2016-1394","DOIUrl":"https://doi.org/10.3233/FI-2016-1394","url":null,"abstract":"We prove the existence of a canonical form for semi-deterministic transducers with incomparable sets of output strings. Based on this, we develop an algorithm which learns semi-deterministic transducers given access to translation queries. We also prove that there is no learning algorithm for semi-deterministic transducers that uses only domain knowledge.","PeriodicalId":56310,"journal":{"name":"Fundamenta Informaticae","volume":"44 1","pages":"33-48"},"PeriodicalIF":0.8,"publicationDate":"2014-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79085901","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}
引用次数: 10
Complex Object-Based Multidimensional Modeling and Cube Construction 基于复杂对象的多维建模与立方体构建
IF 0.8 4区 计算机科学
Fundamenta Informaticae Pub Date : 2014-04-01 DOI: 10.5555/2637688.2637692
BoukraaDoulkifli, BoussaidOmar, BentayebFadila
{"title":"Complex Object-Based Multidimensional Modeling and Cube Construction","authors":"BoukraaDoulkifli, BoussaidOmar, BentayebFadila","doi":"10.5555/2637688.2637692","DOIUrl":"https://doi.org/10.5555/2637688.2637692","url":null,"abstract":"This paper presents a multidimensional model and a language to construct cubes for the purpose of on-line analytical processing. Both the multidimensional model and the cube model are based on the ...","PeriodicalId":56310,"journal":{"name":"Fundamenta Informaticae","volume":"1 1","pages":""},"PeriodicalIF":0.8,"publicationDate":"2014-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"71131339","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
Certificates of Non-Membership for Classes of Read-Once Functions 只读一次函数类的非成员证书
IF 0.8 4区 计算机科学
Fundamenta Informaticae Pub Date : 2014-01-01 DOI: 10.5555/2637677.2637682
ChistikovDmitry, FedorovaValentina, VoronenkoAndrey
{"title":"Certificates of Non-Membership for Classes of Read-Once Functions","authors":"ChistikovDmitry, FedorovaValentina, VoronenkoAndrey","doi":"10.5555/2637677.2637682","DOIUrl":"https://doi.org/10.5555/2637677.2637682","url":null,"abstract":"A certificate of non-membership for a Boolean function f with respect to a class C, f ∉ C, is a set S of input strings such that the values of f on strings from S are inconsistent with any function...","PeriodicalId":56310,"journal":{"name":"Fundamenta Informaticae","volume":"1 1","pages":""},"PeriodicalIF":0.8,"publicationDate":"2014-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"71131044","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 Promptness in Parity Games 论奇偶性游戏中的及时性
IF 0.8 4区 计算机科学
Fundamenta Informaticae Pub Date : 2013-12-14 DOI: 10.3233/FI-2015-1235
F. Mogavero, A. Murano, L. Sorrentino
{"title":"On Promptness in Parity Games","authors":"F. Mogavero, A. Murano, L. Sorrentino","doi":"10.3233/FI-2015-1235","DOIUrl":"https://doi.org/10.3233/FI-2015-1235","url":null,"abstract":"Parity games are a powerful formalism for the automatic synthesis and verification of reactive systems. They are closely related to alternating ω-automata and emerge as a natural method for the solution of the μ-calculus model checking problem. Due to these strict connections, parity games are a well-established environment to describe liveness properties such as “every request that occurs infinitely often is eventually responded”. Unfortunately, the classical form of such a condition suffers from the strong drawback that there is no bound on the effective time that separates a request from its response, i.e., responses are not promptly provided. Recently, to overcome this limitation, several parity game variants have been proposed, in which quantitative requirements are added to the classic qualitative ones.","PeriodicalId":56310,"journal":{"name":"Fundamenta Informaticae","volume":"11 1","pages":"601-618"},"PeriodicalIF":0.8,"publicationDate":"2013-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82385604","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}
引用次数: 29
Deterministic One-Way Turing Machines with Sublinear Space 具有次线性空间的确定性单向图灵机
IF 0.8 4区 计算机科学
Fundamenta Informaticae Pub Date : 2013-08-13 DOI: 10.3233/FI-2015-1147
Martin Kutrib, Julien Provillard, György Vaszil, Matthias Wendlandt
{"title":"Deterministic One-Way Turing Machines with Sublinear Space","authors":"Martin Kutrib, Julien Provillard, György Vaszil, Matthias Wendlandt","doi":"10.3233/FI-2015-1147","DOIUrl":"https://doi.org/10.3233/FI-2015-1147","url":null,"abstract":"Deterministic one-way Turing machines with sublinear space bounds are systematically studied. We distinguish among the notions of strong, weak, and restricted space bounds. The latter is motivated by the study of P automata. The space available on the work tape depends on the number of input symbols read so far, instead of the entire input. The class of functions space constructible by such machines is investigated, and it is shown that every function f that is space constructible by a deterministic two-way Turing machine, is space constructible by a strongly f space-bounded deterministic one-way Turing machine as well. We prove that the restricted mode coincides with the strong mode for space constructible functions. The known infinite, dense, and strict hierarchy of strong space complexity classes is derived also for the weak mode by Kolmogorov complexity arguments. Finally, closure properties under AFL operations, Boolean operations and reversal are shown.","PeriodicalId":56310,"journal":{"name":"Fundamenta Informaticae","volume":"2a 1","pages":"195-208"},"PeriodicalIF":0.8,"publicationDate":"2013-08-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88133646","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}
引用次数: 7
On The Complexity of Counter Reachability Games 论反可达性游戏的复杂性
IF 0.8 4区 计算机科学
Fundamenta Informaticae Pub Date : 2013-07-18 DOI: 10.3233/FI-2016-1320
J. Reichert
{"title":"On The Complexity of Counter Reachability Games","authors":"J. Reichert","doi":"10.3233/FI-2016-1320","DOIUrl":"https://doi.org/10.3233/FI-2016-1320","url":null,"abstract":"Counter reachability games are played by two players on a graph with labelled edges. Each move consists in picking an edge from the current location and adding its label to a counter vector. The objective is to reach a given counter value in a given location. We distinguish three semantics for counter reachability games, according to what happens when a counter value would become negative: the edge is either disabled, or enabled but the counter value becomes zero, or enabled. We consider the problem of deciding the winner in counter reachability games and show that, in most cases, it has the same complexity under all semantics. Surprisingly, under one semantics, the complexity in dimension one depends on whether the objective value is zero or any other integer.","PeriodicalId":56310,"journal":{"name":"Fundamenta Informaticae","volume":"121 1","pages":"196-208"},"PeriodicalIF":0.8,"publicationDate":"2013-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86274828","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}
引用次数: 17
A Regularized, Pyramidal Multi-grid Approach to Global 3D-Volume Digital Image Correlation Based on X-ray Micro-tomography 基于x射线微层析成像的正则化锥体多网格全局三维数字图像相关方法
IF 0.8 4区 计算机科学
Fundamenta Informaticae Pub Date : 2013-07-01 DOI: 10.5555/2594940.2594950
FedeleRoberto, CianiAntonia, GalantucciLuca, BettuzziMatteo, AndenaLuca
{"title":"A Regularized, Pyramidal Multi-grid Approach to Global 3D-Volume Digital Image Correlation Based on X-ray Micro-tomography","authors":"FedeleRoberto, CianiAntonia, GalantucciLuca, BettuzziMatteo, AndenaLuca","doi":"10.5555/2594940.2594950","DOIUrl":"https://doi.org/10.5555/2594940.2594950","url":null,"abstract":"In this study a robust strategy for 3D-Volume Digital Image Correlation DIC is presented, apt to provide accurate kinematic measurements within a loaded sample on the basis of three-dimensional dig...","PeriodicalId":56310,"journal":{"name":"Fundamenta Informaticae","volume":"1 1","pages":""},"PeriodicalIF":0.8,"publicationDate":"2013-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"71129882","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学术官方微信