Regular languages viewed from a graph-theoretic perspective.pdfVIP

下载本文档

3
0
约 13页
2017-03-16 发布于天津
举报
版权申诉

Regular languages viewed from a graph-theoretic perspective.pdf

1、本文档共13页，可阅读全部内容。
2、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。
3、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
5、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
6、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
7、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
8、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

Regular languages viewed from a graph-theoretic perspective.pdf

JID:YINCO AID:4189 /FLA Information and Computation ??? (????) ???–??? [m3G; v1.180; Prn:10/06/2016; 10:07] P.1 (1-13) Contents lists available at ScienceDirect Information and Computation /locate/yinco Regular languages viewed from a graph-theoretic perspective Marius Konitzer, Hans Ulrich Simon ? Horst-G?rtz Institute for IT Security and Faculty of Mathematics, Ruhr-Universit?t Bochum, Germany article info Article history: Received 12 June 2014 Available online xxxx Keywords: Regular language Lookahead DFA Clique number Maximum degree Computational complexity abstract In this paper, we consider the graph G(L|w), resp. the directed graph G(L|w), associated with an arbitrary language L ? ? and an arbitrary string w ∈ ?. The clique number of L is then de?ned as the supremum of the clique numbers of the graphs G(L|w) where w ranges over all strings in ?. The maximum in- or outdegree of L is de?ned analogously. We characterize regular languages with an in?nite clique number and determine tight upper bounds in the ?nite case. We obtain analogous results for the maximum indegree and the maximum outdegree of a regular language. As an application, we consider the problem of determining the maximum activity level of a pre?x-closed regular language — a parameter that is related to the computational complexity of parsing techniques utilizing unbounded regular lookahead. Finally, we determine the computational complexity of various problems arising from our graph-theoretic approach. ? 2016 Elsevier Inc. All rights reserved. 1. Introduction In Section 1.1 of this paper1, we describe the connection between LR-regular parsing and the maximum activity level2 of the lookahead DFAs utilized during parsing. In Section 1.2, we describe the more general approach taken in this paper: we look at languages from a broader graph-theoretic perspective and relate structural properties of regular languages to properties of the (di-)graphs induced by them. 1.1. LR-regular parsing and lookahead