\(\omega\)-regular languages are testable with a constant number of queries (Q706616)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | \(\omega\)-regular languages are testable with a constant number of queries |
scientific article |
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
