<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>A String Diagrammatic Axiomatisation of Finite-State Automata · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2009.14576/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/2009.14576/feed.xml" rel="self" type="application/rss+xml" /><item><title>A String Diagrammatic Axiomatisation of Finite-State Automata — mentioned by jkhdigital</title><link>https://news.ycombinator.com/item?id=29722439</link><guid isPermaLink="false">urn:hackerpapers:mention:2009.14576:29722439</guid><pubDate>Wed, 29 Dec 2021 06:19:45 GMT</pubDate><description>&lt;p&gt;On this topic, I recently came across a nice string diagram formalization for automata: https://arxiv.org/pdf/2009.14576.pdf&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2009.14576/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.FL</category></item></channel></rss>
