Reachability in Unions of Commutative Rewriting Systems Is Decidable.

Mikolaj Bojanczyk Piotr Hoffman

Published in: STACS (2007)

Keyphrases

rewriting systems
transitive closure
rewriting rules
expressive power
first order logic
state space
pattern languages
directed acyclic graph
tree patterns
query language
software engineering
black box