On Boolean combinations forming piecewise testable languages (Q2358689)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6731763
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On Boolean combinations forming piecewise testable languages |
scientific article; zbMATH DE number 6731763 |
Statements
On Boolean combinations forming piecewise testable languages (English)
0 references
15 June 2017
0 references
automata
0 references
languages
0 references
\(k\)-piecewise testability
0 references
complexity
0 references
0 references
0.95086634
0 references
0.9341322
0 references
0.92010725
0 references
0.9136531
0 references
0.89635926
0 references
0.8954203
0 references
0.8954203
0 references
0.88872814
0 references
