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

Hana Chockler*, Orna Kupferman

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

9 Scopus citations

Fingerprint

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

Keyphrases

Computer Science