publication . Article . 2004

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

Chockler, Hana; Kupferman, Orna;
Open Access
  • Published: 01 Dec 2004 Journal: Theoretical Computer Science, volume 329, issue 1-3, pages 71-92 (issn: 0304-3975, Copyright policy)
  • Publisher: Elsevier BV
free text keywords: Theoretical Computer Science, Computer Science(all)
Powered by OpenAIRE Research Graph
Any information missing or wrong?Report an Issue