Showing cs.FLShow all
2 papers · 1 filter
cs.FL2025
Presheaf automata
Georg Struth, Krzysztof ZiemiaÅski
We introduce presheaf automata as a generalisation of different variants of higher-dimensional automata and other automata-like formalisms, including Petri nets and vector addition…
cs.FL2024
Kleene Theorem for Higher-Dimensional Automata
Uli Fahrenberg, Christian Johansen, Georg Struth +1
We prove a Kleene theorem for higher-dimensional automata. It states that the languages they recognise are precisely the rational subsumption-closed sets of finite interval pomsets…