Weak equivalence of higher-dimensional automata

Autor:	Thomas Kahl
Jazyk:	angličtina
Rok vydání:	2021
Předmět:	computer science - logic in computer science computer science - formal languages and automata theory mathematics - algebraic topology 68q85 55n99 Mathematics QA1-939
Zdroj:	Discrete Mathematics & Theoretical Computer Science, Vol vol. 23 no. 1, Iss Automata, Logic and Semantics (2021)
Druh dokumentu:	article
ISSN:	1365-8050 04635884
DOI:	10.46298/dmtcs.5884
Popis:	This paper introduces a notion of equivalence for higher-dimensional automata, called weak equivalence. Weak equivalence focuses mainly on a traditional trace language and a new homology language, which captures the overall independence structure of an HDA. It is shown that weak equivalence is compatible with both the tensor product and the coproduct of HDAs and that, under certain conditions, HDAs may be reduced to weakly equivalent smaller ones by merging and collapsing cubes.
Databáze:	Directory of Open Access Journals
Externí odkaz:	https://doaj.org/article/938836aa12e846b7912f0463588408b4 Zobrazit plný text záznamu View record in DOAJ