Reachability in Unions of Commutative Rewriting Systems Is Decidable (Q3590971)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Reachability in Unions of Commutative Rewriting Systems Is Decidable |
scientific article; zbMATH DE number 5186547
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Reachability in Unions of Commutative Rewriting Systems Is Decidable |
scientific article; zbMATH DE number 5186547 |
Statements
Reachability in Unions of Commutative Rewriting Systems Is Decidable (English)
0 references
3 September 2007
0 references
logic in computer science
0 references
rewriting
0 references
0.8081690073013306
0 references
0.7842686772346497
0 references
0.7782208323478699
0 references
