二元类上的加权上下文无关语法

Sci. Ann. Comput. Sci. Pub Date : 2019-09-10 DOI:10.7561/SACS.2019.1.59

George Rahonis, Faidra Torpari

{"title":"二元类上的加权上下文无关语法","authors":"George Rahonis, Faidra Torpari","doi":"10.7561/SACS.2019.1.59","DOIUrl":null,"url":null,"abstract":"We introduce and investigate weighted context-free grammars over an arbitrary bimonoid K. Thus, we do not assume that the operations of K are commutative or idempotent or they distribute over each other. We prove a Chomsky-Schützenberger type theorem for the series generated by our grammars. Moreover, we show that the class of series generated by weighted right-linear grammars over a linearly ordered alphabet Σ and K coincides with that of recognizable series over Σ and K.","PeriodicalId":394919,"journal":{"name":"Sci. Ann. Comput. Sci.","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Weighted Context-Free Grammars Over Bimonoids\",\"authors\":\"George Rahonis, Faidra Torpari\",\"doi\":\"10.7561/SACS.2019.1.59\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We introduce and investigate weighted context-free grammars over an arbitrary bimonoid K. Thus, we do not assume that the operations of K are commutative or idempotent or they distribute over each other. We prove a Chomsky-Schützenberger type theorem for the series generated by our grammars. Moreover, we show that the class of series generated by weighted right-linear grammars over a linearly ordered alphabet Σ and K coincides with that of recognizable series over Σ and K.\",\"PeriodicalId\":394919,\"journal\":{\"name\":\"Sci. Ann. Comput. Sci.\",\"volume\":\"9 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-09-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Sci. Ann. Comput. Sci.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.7561/SACS.2019.1.59\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Sci. Ann. Comput. Sci.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.7561/SACS.2019.1.59","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

我们在任意双项式K上引入并研究了加权上下文无关语法。因此，我们不假设K的运算是可交换的或幂等的，也不假设它们彼此分布。对于由我们的语法生成的序列，我们证明了一个chomsky - sch岑伯格类型定理。此外，我们证明了在线性有序字母Σ和K上由加权右线性语法生成的级数类与在Σ和K上可识别的级数类是一致的。

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

查看原文本刊更多论文

Weighted Context-Free Grammars Over Bimonoids

We introduce and investigate weighted context-free grammars over an arbitrary bimonoid K. Thus, we do not assume that the operations of K are commutative or idempotent or they distribute over each other. We prove a Chomsky-Schützenberger type theorem for the series generated by our grammars. Moreover, we show that the class of series generated by weighted right-linear grammars over a linearly ordered alphabet Σ and K coincides with that of recognizable series over Σ and K.

求助全文

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

来源期刊

Sci. Ann. Comput. Sci.

自引率

0.00%

发文量