2022/08/03 by Thomas Kahl, Kahl, Thomas
Biochemistry, Genetics and Molecular Biology · Computer Science · #DNA and Biological Computing #Advanced Database Systems and Queries #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.2208.02286
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.