w-Regular languages are testable with a constant number of queries

Hana Chockler, Orna Kupferman

Research output: Contribution to journalArticlepeer-review

9 Citations (Scopus)

Fingerprint

Dive into the research topics of 'w-Regular languages are testable with a constant number of queries'. Together they form a unique fingerprint.

Mathematics

Computer Science