Upper bound on the derivational complexity in some word rewriting system (Q1048539)
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: Upper bound on the derivational complexity in some word rewriting system |
scientific article; zbMATH DE number 5656119
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Upper bound on the derivational complexity in some word rewriting system |
scientific article; zbMATH DE number 5656119 |
Statements
Upper bound on the derivational complexity in some word rewriting system (English)
0 references
12 January 2010
0 references
0.8731237053871155
0 references
0.7631807327270508
0 references
0.7527409195899963
0 references