How hard is it to verify flat affine counter systems with the finite monoid property? (Q1990502)
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: How hard is it to verify flat affine counter systems with the finite monoid property? |
scientific article; zbMATH DE number 6965619
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | How hard is it to verify flat affine counter systems with the finite monoid property? |
scientific article; zbMATH DE number 6965619 |
Statements
How hard is it to verify flat affine counter systems with the finite monoid property? (English)
0 references
25 October 2018
0 references
0.830998420715332
0 references
0.8256217837333679
0 references
0.8220565915107727
0 references
0.8045092225074768
0 references
0.7907788157463074
0 references
