Algorithm for verifying the equivalence of linear unary recursive programs on ordered semigroup scales (Q357923)
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: Algorithm for verifying the equivalence of linear unary recursive programs on ordered semigroup scales |
scientific article; zbMATH DE number 6198428
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithm for verifying the equivalence of linear unary recursive programs on ordered semigroup scales |
scientific article; zbMATH DE number 6198428 |
Statements
Algorithm for verifying the equivalence of linear unary recursive programs on ordered semigroup scales (English)
0 references
15 August 2013
0 references
equivalence test
0 references
recursive programs
0 references
semigroups
0 references
0 references
0 references
0.8985877
0 references
0.89064264
0 references
0 references
0.8704119
0 references
0.86355335
0 references
0.86270124
0 references
0.8611115
0 references
0.8579279
0 references
