scientific article; zbMATH DE number 1756015

zbMATH Open0987.68051MaRDI QIDQ4535801FDOQ4535801

Authors: Michal Kunc 

Publication date: 16 June 2002

Title of this publication is not available (Why is that?)

Recommendations

• Undecidability of the trace coding problem and some decidable cases
• On some decision problems for trace codings
• On codings of traces
• Publication:4939574
• Coding and strong coding in trace monoids

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) Undecidability and degrees of sets of sentences (03D35)

Cited In (6)

• Undecidability of the trace coding problem and some decidable cases
• LAZARD'S ELIMINATION (IN TRACES) IS FINITE-STATE RECOGNIZABLE
• On codings of traces
• Title not available (Why is that?)
• On some decision problems for trace codings
• Any lifting of a trace coding is a word coding

This page was built for publication:

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