@InProceedings{	  ber95,
  author	= "Michael Bertol",
  address	= "Heidelberg",
  booktitle	= "Proc. 10th Fundamentals of Computation Theory (FCT~'95),
		  Dresden (Germany) 1995",
  publisher	= "Springer-Verlag",
  series	= "Lecture Notes in Computer Science",
  volume	= "965",
  editor	= "H. Reichel",
  title		= "Efficient rewriting in cograph trace monoids",
  pages		= "146--155",
  year		= "1995",
  abstract	= "We consider the basic problem of finding irreducible forms
		  w.r.t.\ a finite noetherian rewriting system over a free
		  partially commutative monoid where the underlying
		  dependence alphabet is a cograph. A linear time algorithm
		  is developed which determines irreducible normal forms
		  w.r.t.\ finite, length-reducing trace rewriting systems
		  over cograph monoids. This generalizes well-known results
		  for free monoids and commutative monoids and is a
		  significant improvement to the previously known square time
		  algorithm.",
  doi		= "10.1007/3-540-60249-6_47"
}