利用弦图的有限状态自动机的有限公理化

Log. Methods Comput. Sci. Pub Date : 2022-11-29 DOI:10.46298/lmcs-19(1:13)2023

R. Piedeleu, F. Zanasi

{"title":"利用弦图的有限状态自动机的有限公理化","authors":"R. Piedeleu, F. Zanasi","doi":"10.46298/lmcs-19(1:13)2023","DOIUrl":null,"url":null,"abstract":"We develop a fully diagrammatic approach to finite-state automata, based on\nreinterpreting their usual state-transition graphical representation as a\ntwo-dimensional syntax of string diagrams. In this setting, we are able to\nprovide a complete equational theory for language equivalence, with two notable\nfeatures. First, the proposed axiomatisation is finite. Second, the Kleene star\nis a derived concept, as it can be decomposed into more primitive algebraic\nblocks.","PeriodicalId":314387,"journal":{"name":"Log. Methods Comput. Sci.","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A Finite Axiomatisation of Finite-State Automata Using String Diagrams\",\"authors\":\"R. Piedeleu, F. Zanasi\",\"doi\":\"10.46298/lmcs-19(1:13)2023\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We develop a fully diagrammatic approach to finite-state automata, based on\\nreinterpreting their usual state-transition graphical representation as a\\ntwo-dimensional syntax of string diagrams. In this setting, we are able to\\nprovide a complete equational theory for language equivalence, with two notable\\nfeatures. First, the proposed axiomatisation is finite. Second, the Kleene star\\nis a derived concept, as it can be decomposed into more primitive algebraic\\nblocks.\",\"PeriodicalId\":314387,\"journal\":{\"name\":\"Log. Methods Comput. Sci.\",\"volume\":\"28 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-11-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Log. Methods Comput. Sci.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.46298/lmcs-19(1:13)2023\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Log. Methods Comput. Sci.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.46298/lmcs-19(1:13)2023","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

基于将有限状态自动机通常的状态转换图形表示重新解释为字符串图的二维语法，我们开发了一种完全图解的方法来研究有限状态自动机。在这种情况下，我们能够为语言对等提供一个完整的等式理论，具有两个显著的特征。首先，所提出的公理化是有限的。其次，Kleene星是一个派生概念，因为它可以分解成更原始的代数块。

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

查看原文本刊更多论文

A Finite Axiomatisation of Finite-State Automata Using String Diagrams

We develop a fully diagrammatic approach to finite-state automata, based on reinterpreting their usual state-transition graphical representation as a two-dimensional syntax of string diagrams. In this setting, we are able to provide a complete equational theory for language equivalence, with two notable features. First, the proposed axiomatisation is finite. Second, the Kleene star is a derived concept, as it can be decomposed into more primitive algebraic blocks.

求助全文

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

来源期刊

Log. Methods Comput. Sci.

自引率

0.00%

发文量