The complexity of SORE-definability problems (Q5111236)
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: The complexity of SORE-definability problems |
scientific article; zbMATH DE number 7204356
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of SORE-definability problems |
scientific article; zbMATH DE number 7204356 |
Statements
26 May 2020
0 references
single-occurrence regular expressions
0 references
definability
0 references
complexity
0 references
0 references
0 references
0.7563232779502869
0 references
0.7556846141815186
0 references
0.7508392930030823
0 references
0.7358469367027283
0 references
0.7229836583137512
0 references
