@InProceedings{	  dm96mfcs,
  author	= "Volker Diekert and Anca Muscholl",
  address	= "Heidelberg",
  booktitle	= "Proc. 21st Symposium on Mathematical Foundations of
		  Computer Science (MFCS'96), Cracow (Poland)",
  editor	= "W. Penczek and others",
  note		= "Invited Lecture",
  volume	= "1113",
  pages		= "2--17",
  publisher	= "Springer-Verlag",
  series	= "Lecture Notes in Computer Science",
  title		= "Code problems on traces",
  year		= "1996",
  abstract	= "The topic of codes in the framework of trace monoids leads
		  to interesting and challenging decision problems of
		  combinatorial flavour. We give an overview of the current
		  state of some basic questions in this field. Among these,
		  we consider the existence problem for strong codings,
		  clique-preserving morphisms and the unique decipherability
		  problem (code problem).",
  doi		= "10.1007/3-540-61550-4_137"
}