In natural languages with a high degree of word-order freedom, syntactic phenomena like dependencies (subordinations) or valences do not depend on the word-order (or on the individual positions of the individual words). This means that some permutations of sentences of these languages are in some (important) sense syntactically equivalent. Here we study this phenomenon in a formal way. Various types of j-monotonicity for restarting automata can serve as parameters for the degree of word-order freedom and for the complexity of word-order in sentences (languages). Here we combine two types of parameters on computations of restarting automata: the degree of j-monotonicity, and the number of rewrites per cycle. We study these notions formally in order to obtain an adequate tool for modelling and comparing formal descriptions of (natural) languages with different degrees of word-order freedom and word-order complexity.
{"title":"Free Word-Order and Restarting Automata","authors":"F. Mráz, F. Otto, Martin Plátek","doi":"10.3233/FI-2014-1083","DOIUrl":"https://doi.org/10.3233/FI-2014-1083","url":null,"abstract":"In natural languages with a high degree of word-order freedom, syntactic phenomena like dependencies (subordinations) or valences do not depend on the word-order (or on the individual positions of the individual words). This means that some permutations of sentences of these languages are in some (important) sense syntactically equivalent. Here we study this phenomenon in a formal way. Various types of j-monotonicity for restarting automata can serve as parameters for the degree of word-order freedom and for the complexity of word-order in sentences (languages). Here we combine two types of parameters on computations of restarting automata: the degree of j-monotonicity, and the number of rewrites per cycle. We study these notions formally in order to obtain an adequate tool for modelling and comparing formal descriptions of (natural) languages with different degrees of word-order freedom and word-order complexity.","PeriodicalId":56310,"journal":{"name":"Fundamenta Informaticae","volume":null,"pages":null},"PeriodicalIF":0.8,"publicationDate":"2014-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90653088","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}
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:
本文对基于语言的可达性问题(L-reach)进行了复杂性理论研究:修复一个语言l .给定一个图的边缘标记字母符号和两个特殊顶点s和t,测试如果有路径P s到t图中这样的连接路径的符号从s t P形式语言中的字符串l .我们研究这个问题的变异与不同的图类和不同的语言类和获得所有这些复杂性理论特征。我们的主要结果如下:
{"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":null,"pages":null},"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}
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...
{"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":null,"pages":null},"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}
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...
{"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":null,"pages":null},"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}
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.
{"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":null,"pages":null},"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}
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 ...
本文提出了一种多维模型和多维数据集构建语言，用于在线分析处理。多维模型和多维数据集模型都基于…
{"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":null,"pages":null},"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}
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...
{"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":null,"pages":null},"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}
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.
{"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":null,"pages":null},"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}
Martin Kutrib, Julien Provillard, György Vaszil, Matthias Wendlandt
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.
{"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":null,"pages":null},"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}
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.
{"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":null,"pages":null},"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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：