Efficient simulation of forward-branching systems with constructor systems

DOI10.1006/JSCO.1996.0058zbMath0869.68061OpenAlexW2012032783MaRDI QIDQ674754

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)

Related Items (4)

BRANCHING SYSTEMS FOR HIGHER-RANK GRAPH C*-ALGEBRAS ⋮ Unitary equivalence of representations of graph algebras and branching systems ⋮ Graph \(C^\ast\)-algebras, branching systems and the Perron-Frobenius operator ⋮ On graded irreducible representations of Leavitt path algebras.

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