Efficient simulation of forward-branching systems with constructor systems

DOI10.1006/JSCO.1996.0058MaRDI QIDQ674754zbMATHOpenAlexFDO

Authors Bruno Salinier, Robert Strandh

Publication date 24 April 1997

Published in Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/85140e9523b4e8c8eebfb635fa0f0324bc0bcca7

zbMATH Keywords

reduction algorithmforward-branching systemstrongly sequential constructor system

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• Constructor equivalent term rewriting systems
• Constructor equivalent term rewriting systems are strongly sequential: A direct proof
• Transforming strongly sequential rewrite systems with constructors for efficient parallel execution

Cited in

(9)

• Strong and NV-sequentiality of constructor systems
• Graph \(C^\ast\)-algebras, branching systems and the Perron-Frobenius operator
• Generating applicable synthetic instances for branch problems
• Branching systems for higher-rank graph \(C^*\)-algebras
• Unitary equivalence of representations of graph algebras and branching systems
• On graded irreducible representations of Leavitt path algebras.
• Constructor equivalent term rewriting systems
• Constructor equivalent term rewriting systems are strongly sequential: A direct proof
• On the correspondence between two classes of reduction systems

This page was built for publication: Efficient simulation of forward-branching systems with constructor systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q674754)