Reducing the gradedness problem of string rewriting systems to a termination problem (Q3465631)
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: Reducing the gradedness problem of string rewriting systems to a termination problem |
scientific article; zbMATH DE number 6534491
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Reducing the gradedness problem of string rewriting systems to a termination problem |
scientific article; zbMATH DE number 6534491 |
Statements
Reducing the gradedness problem of string rewriting systems to a termination problem (English)
0 references
22 January 2016
0 references
string rewriting
0 references
termination
0 references
gradedness
0 references
0.7864914536476135
0 references
0.7652979493141174
0 references
0.7652979493141174
0 references
0.7609468698501587
0 references
