零和自由交换半环上可识别级数的支持是可识别的

IF 0.3 Q4 COMPUTER SCIENCE, CYBERNETICS

Acta Cybernetica Pub Date : 2009-07-01 DOI:10.14232/actacyb.20.2.2011.1

D. Kirsten

{"title":"零和自由交换半环上可识别级数的支持是可识别的","authors":"D. Kirsten","doi":"10.14232/actacyb.20.2.2011.1","DOIUrl":null,"url":null,"abstract":"We show that the support of a recognizable series over a zero-sum free, commutative semiring is a recognizable language. We also give a sufficient and necessary condition for the existence of an effective transformation of a weighted automaton recognizing a series S over a zero-sum free, commutative semiring into an automaton recognizing the support of S.","PeriodicalId":42512,"journal":{"name":"Acta Cybernetica","volume":null,"pages":null},"PeriodicalIF":0.3000,"publicationDate":"2009-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"21","resultStr":"{\"title\":\"The Support of a Recognizable Series over a Zero-sum Free, Commutative Semiring is Recognizable\",\"authors\":\"D. Kirsten\",\"doi\":\"10.14232/actacyb.20.2.2011.1\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We show that the support of a recognizable series over a zero-sum free, commutative semiring is a recognizable language. We also give a sufficient and necessary condition for the existence of an effective transformation of a weighted automaton recognizing a series S over a zero-sum free, commutative semiring into an automaton recognizing the support of S.\",\"PeriodicalId\":42512,\"journal\":{\"name\":\"Acta Cybernetica\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.3000,\"publicationDate\":\"2009-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"21\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Acta Cybernetica\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.14232/actacyb.20.2.2011.1\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, CYBERNETICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Acta Cybernetica","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.14232/actacyb.20.2.2011.1","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, CYBERNETICS","Score":null,"Total":0}

引用次数: 21

摘要

我们证明了零和自由交换半环上可识别级数的支持是一种可识别的语言。并给出了在零和自由交换半环上识别序列S的加权自动机到识别S支持的自动机的有效变换的充要条件。

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

查看原文本刊更多论文

The Support of a Recognizable Series over a Zero-sum Free, Commutative Semiring is Recognizable

We show that the support of a recognizable series over a zero-sum free, commutative semiring is a recognizable language. We also give a sufficient and necessary condition for the existence of an effective transformation of a weighted automaton recognizing a series S over a zero-sum free, commutative semiring into an automaton recognizing the support of S.

求助全文

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

来源期刊

Acta Cybernetica COMPUTER SCIENCE, CYBERNETICS-

CiteScore

1.10

自引率

0.00%

发文量

期刊介绍： Acta Cybernetica publishes only original papers in the field of Computer Science. Manuscripts must be written in good English.