Regular Languages are Testable with a Constant Number of Queries (Q2706138)
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
Language | Label | Description | Also known as |
---|---|---|---|
English | Regular Languages are Testable with a Constant Number of Queries |
scientific article |
Statements
Regular Languages are Testable with a Constant Number of Queries (English)
0 references
19 March 2001
0 references
property testing
0 references
regular languages
0 references
context-free languages
0 references