On codings of traces

DOI10.1007/3-540-59042-0_90MaRDI QIDQ4596638zbMATH OpenOpenAlexFDO

Authors Volker Diekert, Anca Muscholl, Klaus Reinhardt

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

concurrencyformal languages

Mathematics Subject Classification ID

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

Recommendations

• On some decision problems for trace codings
• Coding and strong coding in trace monoids
• Undecidability of the trace coding problem and some decidable cases
• scientific article; zbMATH DE number 1756015
• scientific article; zbMATH DE number 1400021

Cited in

(11)

• The code problem for traces -- improving the boundaries
• The homomorphism problem for trace monoids.
• Undecidability of the trace coding problem and some decidable cases
• The trace monoids in the queue monoid and in the direct product of two free monoids
• scientific article; zbMATH DE number 3959809 (Why is no real title available?)
• scientific article; zbMATH DE number 1114032 (Why is no real title available?)
• scientific article; zbMATH DE number 1756015 (Why is no real title available?)
• The inclusion structure of partially lossy queue monoids and their trace submonoids
• scientific article; zbMATH DE number 1400021 (Why is no real title available?)
• On some decision problems for trace codings
• Any lifting of a trace coding is a word coding

This page was built for publication: On codings of traces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4596638)