1 paper
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…