Reachability and confluence are undecidable for flat term rewriting systems (Q1014436)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5547810
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Reachability and confluence are undecidable for flat term rewriting systems |
scientific article; zbMATH DE number 5547810 |
Statements
Reachability and confluence are undecidable for flat term rewriting systems (English)
0 references
28 April 2009
0 references
theory of computation
0 references
term rewriting
0 references
0 references
0.9216089248657228
0 references
0.8905025720596313
0 references
0.878183901309967
0 references
0.8624486923217773
0 references
0.8261906504631042
0 references
