scientific article; zbMATH DE number 4205990

MaRDI QIDQ3355239zbMATH OpenFDO

Authors Volker Diekert

Publication date 1990

zbMATH Keywords

concurrent processesconfluencefinite noetherian systemsfree partially commutative monoidsirreducible normal formsreplacement systems

Mathematics Subject Classification ID

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

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

Cited in

(11)

• Combinatorics on traces
• Asynchronous automata versus asynchronous cellular automata
• Confluence problems for trace rewriting systems
• scientific article; zbMATH DE number 4030960 (Why is no real title available?)
• scientific article; zbMATH DE number 176737 (Why is no real title available?)
• Uniform rewriting based on permutations
• scientific article; zbMATH DE number 522832 (Why is no real title available?)
• scientific article; zbMATH DE number 7456060 (Why is no real title available?)
• Efficient rewriting in cograph trace monoids
• Word problems over traces which are solvable in linear time
• Word problems over traces which are solvable in linear time

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)