Reachability in Unions of Commutative Rewriting Systems Is Decidable (Q3590971)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Reachability in Unions of Commutative Rewriting Systems Is Decidable
scientific article

    Statements

    Reachability in Unions of Commutative Rewriting Systems Is Decidable (English)
    0 references
    0 references
    0 references
    0 references
    3 September 2007
    0 references
    0 references
    0 references
    0 references
    0 references
    logic in computer science
    0 references
    rewriting
    0 references
    0 references