Coding and strong coding in trace monoids

DOI10.1007/3-540-59042-0_89MaRDI QIDQ4596637zbMATH OpenOpenAlexFDO

Authors Véronique Bruyère, Clelia De Felice

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_89

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

• scientific article; zbMATH DE number 1400021
• Codes and maximal monoids
• Monoids and maximal codes
• Maximality of codes in free monoids
• Full monoids and maximal codes
• Remark on coding in algebras with strong filtration
• scientific article; zbMATH DE number 148019
• scientific article; zbMATH DE number 2077099
• On monomial codes in modular group algebras
• scientific article; zbMATH DE number 3987346

Cited in

(9)

• Undecidability of the trace coding problem and some decidable cases
• Monoids and maximal codes
• scientific article; zbMATH DE number 1114032 (Why is no real title available?)
• scientific article; zbMATH DE number 1756015 (Why is no real title available?)
• On codings of traces
• Almost-disjoint coding and strongly saturated ideals
• scientific article; zbMATH DE number 1400021 (Why is no real title available?)
• LAZARD'S ELIMINATION (IN TRACES) IS FINITE-STATE RECOGNIZABLE
• Any lifting of a trace coding is a word coding

This page was built for publication: Coding and strong coding in trace monoids

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