scientific article; zbMATH DE number 4205990

zbMATH Open0729.68034MaRDI QIDQ3355239FDOQ3355239

Authors: Volker Diekert 

Publication date: 1990

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

Recommendations

• Confluence problems for trace rewriting systems
• Word problems over traces which are solvable in linear time
• Word problems over traces which are solvable in linear time
• Combinatorics on traces
• scientific article; zbMATH DE number 1015107

zbMATH Keywords

confluenceconcurrent processesfree partially commutative monoidsreplacement systemsfinite noetherian systemsirreducible normal forms

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Grammars and rewriting systems (68Q42)

Cited In (10)

• Confluence problems for trace rewriting systems
• Word problems over traces which are solvable in linear time
• Asynchronous automata versus asynchronous cellular automata
• Title not available (Why is that?)
• Uniform rewriting based on permutations
• Word problems over traces which are solvable in linear time
• Title not available (Why is that?)
• Title not available (Why is that?)
• Efficient rewriting in cograph trace monoids
• Title not available (Why is that?)

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 Q3355239)