\(\omega\)-regular languages are testable with a constant number of queries (Q706616)
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: -regular languages are testable with a constant number of queries |
scientific article; zbMATH DE number 2132495
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | \(\omega\)-regular languages are testable with a constant number of queries |
scientific article; zbMATH DE number 2132495 |
Statements
\(\omega\)-regular languages are testable with a constant number of queries (English)
0 references
9 February 2005
0 references
Property testing
0 references
\(\omega\)-regular languages
0 references
algorithms
0 references
complexity
0 references
0 references
0.887579619884491
0 references
0.887579619884491
0 references
0.7999453544616699
0 references
0.7858906388282776
0 references
