On codings of traces

DOI10.1007/3-540-59042-0_90zbMath1379.68243OpenAlexW1535337588MaRDI QIDQ4596638

Klaus Reinhardt, Volker Diekert, Anca Muscholl

Publication date: 4 December 2017

Published in: STACS 95 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-59042-0_90

zbMATH Keywords

formal languagesconcurrency

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Semigroups in automata theory, linguistics, etc. (20M35)

Related Items (5)

Undecidability of the trace coding problem and some decidable cases ⋮ The inclusion structure of partially lossy queue monoids and their trace submonoids ⋮ The code problem for traces -- improving the boundaries ⋮ On some decision problems for trace codings ⋮ The Trace Monoids in the Queue Monoid and in the Direct Product of Two Free Monoids

This page was built for publication: On codings of traces