论l -可达性的复杂性

IF 0.4 4区计算机科学 Q4 COMPUTER SCIENCE, SOFTWARE ENGINEERING

Fundamenta Informaticae Pub Date : 2014-08-05 DOI:10.3233/FI-2016-1371

Balagopal Komarath, Jayalal Sarma, K. S. Sunil

{"title":"论l -可达性的复杂性","authors":"Balagopal Komarath, Jayalal Sarma, K. S. Sunil","doi":"10.3233/FI-2016-1371","DOIUrl":null,"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.4000,"publicationDate":"2014-08-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"On the Complexity of L-reachability\",\"authors\":\"Balagopal Komarath, Jayalal Sarma, K. S. Sunil\",\"doi\":\"10.3233/FI-2016-1371\",\"DOIUrl\":null,\"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.4000,\"publicationDate\":\"2014-08-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Fundamenta Informaticae\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.3233/FI-2016-1371\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, SOFTWARE ENGINEERING\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Fundamenta Informaticae","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.3233/FI-2016-1371","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}

引用次数: 2

摘要

本文对基于语言的可达性问题(L-reach)进行了复杂性理论研究:修复一个语言l .给定一个图的边缘标记字母符号和两个特殊顶点s和t,测试如果有路径P s到t图中这样的连接路径的符号从s t P形式语言中的字符串l .我们研究这个问题的变异与不同的图类和不同的语言类和获得所有这些复杂性理论特征。我们的主要结果如下:

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

On the Complexity of L-reachability

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:

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Fundamenta Informaticae 工程技术-计算机：软件工程

CiteScore

2.00

自引率

0.00%

发文量

审稿时长

9.8 months

期刊介绍： Fundamenta Informaticae is an international journal publishing original research results in all areas of theoretical computer science. Papers are encouraged contributing: solutions by mathematical methods of problems emerging in computer science solutions of mathematical problems inspired by computer science. Topics of interest include (but are not restricted to): theory of computing, complexity theory, algorithms and data structures, computational aspects of combinatorics and graph theory, programming language theory, theoretical aspects of programming languages, computer-aided verification, computer science logic, database theory, logic programming, automated deduction, formal languages and automata theory, concurrency and distributed computing, cryptography and security, theoretical issues in artificial intelligence, machine learning, pattern recognition, algorithmic game theory, bioinformatics and computational biology, quantum computing, probabilistic methods, algebraic and categorical methods.