Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

6

FSTTCS
1998
Springer

favoriteEmaildiscussreport

119views Software Engineering» more FSTTCS 1998»

On the Confluence of Trace Rewriting Systems

13 years 9 months ago

On the Confluence of Trace Rewriting Systems

Download www.informatik.uni-leipzig.de

In [NO88], a particular trace monoid M is constructed such that for the class of length

Markus Lohrey

Real-time Traffic

FSTTCS 1998 | Particular Trace Monoid | Software Engineering | Trace Monoid | Trace Rewriting Systems |

claim paper

Related Content

» Undecidable Properties on LengthTwo String Rewriting Systems

» Modularity of Confluence

» Infinite Families of Finite String Rewriting Systems and Their Confluence

» The Confluence Problem for Flat TRSs

» Partial monoids associativity and confluence

» Using groups for investigating rewrite systems

» Confluence of Conditional Rewrite Systems

» Termination and Confluence of HigherOrder Rewrite Systems

» Automated Confluence Proof by Decreasing Diagrams based on RuleLabelling

Post Info
More Details (n/a)

Added	05 Aug 2010
Updated	05 Aug 2010
Type	Conference
Year	1998
Where	FSTTCS
Authors	Markus Lohrey

Comments (0)