Complexity of counting first-order logic for the subword order (Q5089232)
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: Complexity of counting first-order logic for the subword order |
scientific article; zbMATH DE number 7559432
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of counting first-order logic for the subword order |
scientific article; zbMATH DE number 7559432 |
Statements
18 July 2022
0 references
counting logic
0 references
piecewise testable languages
0 references
0.9629811644554138
0 references
0.8246989250183105
0 references
0.801814615726471
0 references
