关于过渡系统HDA模型的同调语言

Journal of applied and computational topology Pub Date : 2023-05-04 DOI:10.1007/s41468-023-00120-1

Thomas Kahl

{"title":"关于过渡系统HDA模型的同调语言","authors":"Thomas Kahl","doi":"10.1007/s41468-023-00120-1","DOIUrl":null,"url":null,"abstract":"Abstract Given a transition system with an independence relation on the alphabet of labels, one can associate with it a usually very large symmetric higher-dimensional automaton. The purpose of this paper is to show that by choosing an acyclic relation whose symmetric closure is the given independence relation, it is possible to construct a much smaller nonsymmetric HDA with the same homology language.","PeriodicalId":73600,"journal":{"name":"Journal of applied and computational topology","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On the homology language of HDA models of transition systems\",\"authors\":\"Thomas Kahl\",\"doi\":\"10.1007/s41468-023-00120-1\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Abstract Given a transition system with an independence relation on the alphabet of labels, one can associate with it a usually very large symmetric higher-dimensional automaton. The purpose of this paper is to show that by choosing an acyclic relation whose symmetric closure is the given independence relation, it is possible to construct a much smaller nonsymmetric HDA with the same homology language.\",\"PeriodicalId\":73600,\"journal\":{\"name\":\"Journal of applied and computational topology\",\"volume\":\"8 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-05-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of applied and computational topology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/s41468-023-00120-1\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of applied and computational topology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/s41468-023-00120-1","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

摘要给定一个在标签字母上具有独立关系的过渡系统，我们可以将一个通常非常大的对称高维自动机与它联系起来。本文的目的是证明通过选择一个对称闭包为给定独立关系的非环关系，可以构造一个具有相同同调语言的小得多的非对称HDA。

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

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

On the homology language of HDA models of transition systems

Abstract Given a transition system with an independence relation on the alphabet of labels, one can associate with it a usually very large symmetric higher-dimensional automaton. The purpose of this paper is to show that by choosing an acyclic relation whose symmetric closure is the given independence relation, it is possible to construct a much smaller nonsymmetric HDA with the same homology language.

求助全文

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

来源期刊