转换系统和引用语言的注入包

RAIRO Theor. Informatics Appl. Pub Date : 2019-07-04 DOI:10.1051/ita/2020005

M. Kabil, M. Pouzet

{"title":"转换系统和引用语言的注入包","authors":"M. Kabil, M. Pouzet","doi":"10.1051/ita/2020005","DOIUrl":null,"url":null,"abstract":"We consider reflexive and involutive transition systems over an ordered alphabet A equipped with an involution. We give a description of the injective envelope of any two-element set in terms of Galois lattice, from which we derive a test of its finiteness. Our description leads to the notion of Ferrers language.","PeriodicalId":438841,"journal":{"name":"RAIRO Theor. Informatics Appl.","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Injective envelopes of transition systems and Ferrers languages\",\"authors\":\"M. Kabil, M. Pouzet\",\"doi\":\"10.1051/ita/2020005\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider reflexive and involutive transition systems over an ordered alphabet A equipped with an involution. We give a description of the injective envelope of any two-element set in terms of Galois lattice, from which we derive a test of its finiteness. Our description leads to the notion of Ferrers language.\",\"PeriodicalId\":438841,\"journal\":{\"name\":\"RAIRO Theor. Informatics Appl.\",\"volume\":\"18 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-07-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"RAIRO Theor. Informatics Appl.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1051/ita/2020005\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"RAIRO Theor. Informatics Appl.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1051/ita/2020005","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 4

摘要

我们考虑具有对合性的有序字母A上的自反和对合过渡系统。给出了任意二元集的伽罗瓦格内射包络的描述，并由此导出了其有限性的一个检验。我们的描述引出了费雷尔斯语言的概念。

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

查看原文本刊更多论文

Injective envelopes of transition systems and Ferrers languages

We consider reflexive and involutive transition systems over an ordered alphabet A equipped with an involution. We give a description of the injective envelope of any two-element set in terms of Galois lattice, from which we derive a test of its finiteness. Our description leads to the notion of Ferrers language.

求助全文

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

来源期刊

RAIRO Theor. Informatics Appl.

自引率

0.00%

发文量