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

Hana Chockler Orna Kupferman

Published in: Theor. Comput. Sci. (2004)

Keyphrases

small number
computational complexity
query language
database
query evaluation
machine learning
query processing
decision rules